Self-adjusting binary search trees
Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Combinatorial algorithms for the generalized circulation problem
Mathematics of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Speeding up Karmarkar's algorithm for multicommodity flows
Mathematical Programming: Series A and B
A faster combinatorial algorithm for the generalized circulation problem
Mathematics of Operations Research
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Mathematics of Operations Research
Faster Algorithms for the Generalized Network Flow Problem
Mathematics of Operations Research
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A simple GAP-canceling algorithm for the generalized maximum flow problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science
Scheduling unrelated parallel machines computational results
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Generalized maximum flows over time
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We consider the maximum generalised network flow problem and a supply-scaling algorithmic framework for this problem. We present three network-modification operations, which may significantly decrease the size of the network when the remaining node supplies become small. We use these three operations in Goldfarb et al.'s supply-scaling algorithm and prove an Õ(m2n log B) bound on the running time of the resulting algorithm. The previous best time bounds on computing maximum generalised flows are the O(m1.5n log B) bound of Kapoor and Vaidya's algorithm based on the interior-point method, and the Õ(m3 log B) bound of Goldfarb et al.'s algorithm.