On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 320-327

  Klein, Philip ^a   Young, Neal ^b  

^a BROWN UNIVERSITY   (United States)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84948978415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_24     Document Type: Conference Paper

References (20)

1. B. Awerbuch and T. Leighton. A simple local-control approximation algorithm for multicommodity flow. In Proc. of the 34th IEEE Annual Symp. on Foundation of Computer Science, pages 459-468, 1993.
2. B. Awerbuch and T. Leighton. Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks. In Proc. of the 26th Ann. ACM Symp. on Theory of Computing, pages 487-495, 1994.
3. J. F. Benders Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238-252, 1962.
4. G. B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Res., 8:101-111, 1960.
5. Y. Freund and R. Schapire. Adaptive game playing using multiplicative weights. J. Games and Economic Behavior, to appear.
6. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proc. of the 39th Annual Symp. on Foundations of Computer Science, pages 300-309, 1998.
7. A. V. Goldberg. A natural randomization strategy for multicommodity flow and related problems. Information Processing Letters, 42:249-256, 1992.
8. M. D. Grigoriadis and L. G. Khachiyan. A sublinear-time randomized approximation algorithm for matrix games. Technical Report LCSR-TR-222, Rutgers University Computer Science Department, New Brunswick, NJ, April 1994.
9. M. Held and R. M. Karp. The traveling salesman problem and minimum spanning trees. Operations Research, 18:1138-1162, 1971
10. M. Held and R. M. Karp. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1:6-25, 1971.
11. D. Karger and S. Plotkin. Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. In Proc. of the 27th Ann. ACM Symp. on Theory of Computing, pages 18-25, 1995.
12. L. G. Khachiyan. Convergence rate of the game processes for solving matrix games. Zh. Vychisl. Mat. and Mat. Fiz., 17:1421-1431, 1977. English translation in USSR Comput. Math and Math. Phys., 17:78-88, 1978.
13. 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. SIAM Journal on Computing, 23(3):466-487, June 1994.
14. L. R. Ford and D. R. Fulkerson. A suggested computation for maximal multicommodity network flow. Management Sci., 5:97-101, 1958.
15. T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228, 1995.
16. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research,, 20:257-301, 1995.
17. T. Radzik. Fast deterministic approximation for the multicommodity flow problem. In Proc. of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 486-492, 1995.
18. F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. JACM, 37:318-334, 1990.
19. J. F. Shapiro. A survey of lagrangean techniques for discrete optimization. Annals of Discrete Mathematics, 5:113-138, 1979.
20. N. E. Young. Randomized rounding without solving the linear program. In Proc. of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 170-178, 1995.