519 search results - page 1 / 104 » A New Approach to Strongly Polynomial Linear Programming |
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
SODA
2000
ACM
14 years 6 days ago
2000
ACM
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 ...
JCT
2000
13 years 10 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
SIAMDM
2010
13 years 5 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...