Approximating fractional packings and coverings in O(1/ε) iterations

SIAM Journal on Computing

Volumn 35, Issue 4, 2006, Pages 825-854

  Bienstock, D ^a   Iyengar, G ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

Approximation algorithms; Multicommodity flows; Packing problems

Indexed keywords

APPROXIMATION ALGORITHMS; MULTICOMMODITY FLOWS; PACKING PROBLEMS;

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

ITERATIVE METHODS;

EID: 33747190122     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447293     Document Type: Conference Paper

References (31)

1. R. AHUJA, T. L. MAGNANTI, AND J. ORLIN, Networks Flows: Theory, Algorithms, and Practice, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. B. AWERBUCH AND T. LEIGHTON, A simple local-control approximation algorithm for multicommodity flow, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1993, pp. 459-468.
3. D. BIENSTOCK, Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice, Kluwer, Boston, MA, 2002.
4. D. BIENSTOCK AND O. RASKIN, Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem, Math. Prog., 91 (2002), pp. 379-492.
5. L. K. FLEISCHER, Approximating fractional multicommodity flow independent of the number of commodities, SIAM J. Discrete Math., 13 (2000), pp. 505-520.
6. M. FRANK AND P. WOLFE, An algorithm for quadratic programming, Naval Res. Logist. Quart., 3 (1956), pp. 95-110.
7. L. FRATTA, M. GERLA, AND L. KLEINROCK, The flow deviation method: An approach to store-and-forward communication network design, Networks, 3 (1971), pp. 97-133.
8. N. GARG AND J. KÖNEMANN, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1998, pp. 300-309.
9. M. D. GRIGORIADIS AND L. G. KHACHIYAN, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM J. Optim., 4 (1994), pp. 86-107.
10. M. D. GRIGORIADIS AND L. G. KHACHIYAN, An exponential-function reduction method for block-angular convex programs, Networks, 26 (1995), pp. 59-68.
11. -2K N M) time, Math. Prog., 75 (1996), pp. 477-482.
12. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
13. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, 2nd ed., Springer-Verlag, Berlin, 1993.
14. S. KAPOOR AND P. M. VAIDYA, Fast algorithms for convex quadratic programming and multicommodity flows, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM, New York, 1986, pp. 147-159.
15. P. KLEIN, S. PLOTKIN, C. STEIN, AND E. TARDOS, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 310-321.
16. P. KLEIN AND N. YOUNG, On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms, in Integer Programming and Combinatorial Optimization, Springer, Berlin, 1999, pp. 320-327.
17. M. K. KOZLOV, S. P. TARASOV, AND L. G. KHACHIYAN, Polynomial solvability of convex quadratic programming, Soviet Math. Dokl., 20 (1979), pp. 1108-1111.
18. M. K. KOZLOV, S. P. TARASOV, AND L. G. KHACHIYAN, The polynomial solvability of convex quadratic programming, USSR Comput. Math. Phys., 20 (1980), pp. 223-228.
19. T. LEIGHTON, F. MAKEDON, S. PLOTKIN, C. STEIN, E. TARDOS, AND S. TRAGOUDAS, Fast approximation algorithms for multicommodity flow problems, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 101-111.
20. M. MINOUX, A polynomial algorithm for minimum quadratic cost flows, European J. Oper. Res., 18 (1984), pp. 377-387.
21. A. NEMIROVSKI, Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM J. Optim., 15 (2004), pp. 229-251.
22. Y. NESTEROV, Smooth minimization of non-smooth functions, Math. Program. Ser. A, 103 (2005), pp. 127-152.
23. S. PLOTKIN AND D. KARGER, Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, New York, 1995, pp. 18-25. Available online at http://troll-w.stanford.edu/plotkin/ mcf.html.
24. S. PLOTKIN, D. B. SHMOYS, AND E. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 495-504.
25. T. RADZIK, Fast deterministic approximation for the multicommodity flow problem in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, pp. 486-492.
26. F. SHAHROKHI AND D. W. MATULA, The maximum concurrent flow problem, J. ACM, 37 (1991), pp. 318-334.
27. L. TUNÇEL, Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization, Lecture Notes, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario, Canada. Available from the author.
28. P. M. VAIDYA, Speeding up linear programming using fast matrix multiplication, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1989, pp. 332-337.
29. P. M. VAIDYA, A new algorithm for minimizing convex functions over convex sets, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1989, pp. 338-343.
30. J. VILLAVICENCIO AND M. D. GRIGORIADIS, Approximate Lagrangian decomposition using a modified Karmarkar logarithmic potential, in Network Optimization, Lecture Notes in Economics and Mathematical Systems 450, P. Pardalos, D. Hearn, and W. Hager, eds., Springer-Verlag, Berlin, 1995, pp. 471-485.
31. N. YOUNG, Sequential and parallel algorithms for mixed packing and covering, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 2001, pp. 538-546.