65 search results - page 1 / 13 » A Polynomial Combinatorial Algorithm for Generalized Minimum... |
STOC
1999
ACM
13 years 9 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
SODA
2000
ACM
13 years 6 months 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 ...
IPCO
1998
13 years 6 months ago
1998
AMC
2006
13 years 4 months ago
2006
DAC
2009
ACM
14 years 5 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...