Solving fractional packing problems in O*(1/ε) iterations

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 146-155

  Bienstock, D ^a   Iyengar, G ^a  

^a Columbia University ^*  (United States)

Author keywords

Algorithms

Indexed keywords

CAPACITATED NETWORKS; FLOW PROBLEM; FRACTIONAL PACKING; POLYHEDRON; DEGREE OF ACCURACY; FLOW PROBLEMS; LINEAR PROGRAMS; MAXIMUM CONCURRENT FLOW; OPTIMAL SOLUTIONS; PACKING PROBLEMS; PIECEWISE LINEAR; PIECEWISE-LINEAR; QUADRATIC PROGRAMS;

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; ROUTERS; VECTORS; FLOW GRAPHS; INTEGER PROGRAMMING; QUADRATIC PROGRAMMING;

CONGESTION CONTROL (COMMUNICATION); PIECEWISE LINEAR TECHNIQUES;

EID: 4544321135     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Ahuja, T. L. Magnanti, and J. Orlin. Networks Flows: Theory, Algorithms, and Practice, Prentice Hall. 1993.
2. D. Bienstock. Potential Function Methods for Approximately Solving Linear Programming Problems, Theory and Practice, Kluwer, Boston. 2002. An early version downloadable from www.core.ucl.ac.be.
3. D. Bienstock and O. Raskina. Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Prog. 91:379-492, 2002.
4. L.K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Disc. Math., 13:505-520, 2000.
5. M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval Res. Log. Quart. 3:149-154, 1956.
6. L. Fratta, M. Gerla and L. Kleinrock. The flow deviation method: an approach to store-and-forward communication network design. Networks 3:97-133, 1971.
7. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proc. 39th Ann. Symp. on Foundations of Comp. Sci. (FOCS), 300-309, 1998.
8. M.D. Grigoriadis and L.G. Khachiyan. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim., 4:86-107, 1994.
9. M.D. Grigoriadis and L.G. Khachiyan. An exponential-function reduction method for block-angular convex programs. Networks 26:59-68, 1995.
10. -2KNM) time. Math. Prog., 75:477-482, 1996.
11. M. Minoux. A polynomial algorithm for minimum quadratic cost flows. European J. Oper. Res. 18:377-387, 1984.
12. 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. Proc. 22nd Ann. ACM Symp. on Theory of Computing (STOC), 310-321, 1990.
13. P. Klein and N. Young. On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms, Proceedings of IPCO VII, 320-327, 1999.
14. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems, Proc. 23nd Ann. ACM Symp. on Theory of Computing (STOC), 101-111, 1999.
15. 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. Under review in SIAM J. Optim. 2003.
16. Y. Nesterov. Smooth minimization of non-smooth functions. CORE Discussion Paper, CORE, UCL, Belgium. 2003.
17. 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 (STOC), 18-25, 1995.
18. S. Plotkin, D.B. Shmoys and E. Tardos. Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res. 20:495-504, 1995.
19. T. Radzik. Fast deterministic approximation for the multicommodity flow problem. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1995.
20. F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. J. ACM 37:318-334, 1991.
21. J. Villavicencio and M.D. Grigoriadis. Approximate Lagrangian decomposition using a modified Karmarkar logarithmic potential. In Network Optimization (Pardalos and Hager, eds.) Lecture Notes in Economics and Mathematical Systems 450 Springer-Verlag, Berlin, 471-485, 1995.