&egr;-Approximate linear programs: new bounds and computation

Authors:
Daniel Bienstock
Affiliations:
Columbia University
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 3
Cited 0

Fast approximation algorithms for fractional packing and covering problems

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract