Sciweavers

SODA
2000
ACM

120views Algorithms» more SODA 2000»

Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

14 years 4 months ago

This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...

S. Thomas McCormick, Akiyoshi Shioura

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers