Iterative methods in combinatorial optimization

Iterative Methods in Combinatorial Optimization

Volumn 9781107007512, Issue , 2011, Pages 1-242

  Lau, Lap Chi ^a   Ravi, R ^b   Singh, Mohit ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; ITERATIVE METHODS; LINEAR ALGEBRA;

ADVANCED APPLICATIONS; APPROXIMATE OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; FUTURE APPLICATIONS; GRADUATE LEVELS; INTRODUCTORY COURSE; PRESENTATION STYLE; PRIMAL-DUAL METHODS;

OPTIMIZATION;

EID: 84923944429     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511977152     Document Type: Book

References (135)

1. A. Agrawal, P. Klein, R. Ravi, When trees collide: An approximation algorithm for the generalized Steiner problem on networks, in Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing (STOC), 134-144, 1991.
2. N. Alon, J. Spencer, The probabilistic method, 3rd edition, Wiley Series in Discrete Mathematics and Optimization, 2008.
3. N. Andelman, Y. Mansour, Auctions with budget constraints, in Proceedings of 9th ScandinavianWorkshop on Algorithm Theory (SWAT), 26-38, 2004.
4. S. A. Andrea, E. T. Wong, Row rank and column rank of a matrix, Mathematics Magazine, 34(1), 33-34, 1960.
5. E. M. Arkin, R. Hassin, On local search for weighted k-set packing, Mathematics of Operations Research, 23(3), 640-648, 1998.
6. Y. Azar, B. Birnbaum, A. Karlin, C. Mathieu, C. Nguyen, Improved approximation algorithms for budgeted allocations, in Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP), 186-197, 2008.
7. N. Bansal, R. Khandekar, J. Konemann, V. Nagarajan, B Peis, On generalizations of network design problems with degree bounds, in Proceedings of Integer Programming and Combinatorial Optimization (IPCO), 2010.
8. N. Bansal, R. Khandekar, V. Nagarajan, Additive guarantees for degree bounded directed network design, in Proceedings of the Fourtieth Annual ACM Symposium on Theory of Computing (STOC), 769-778, 2008.
9. R. Bar-Yehuda, Using homogenous weights for approximating the partial cover problem, in Proceedings of the 10th AnnualACM-SIAM Symposium on Discrete Algorithms (SODA), 71-75, 1999.
10. I. Barany, On the power of linear dependencies, In Building Bridges, Grotschel and Katona, editors, Springer, 31-45, 2008.
11. I. Barany, A vector-sum theorem and its application to improving flow shop guarantees, Mathematics of Operations Research, 6, 445-452, 1981.
12. J. Beck and T. Fiala, "Integer-making" theorems, Discrete Applied Mathematics, 3, 1-8, 1981.
13. D. Bednarchak, M. Helm, A note on the Beck-Fiala theorem, Combinatorica, 17(1), 147-149, 1997.
14. P. Berman, A d/2 approximation for maximum weight indepedent set in d-claw free graphs, in Proceedings of the 7th Scandinavian Workshop on Algorithms Theory (SWAT), 31-40, 2000.
15. P. Berman, V. Ramaiyer, Improved approximations for the Steiner tree problem, In Proceedings of the ThirdAnnualACM-SIAM Symposium on Discrete Algorithm (SODA), 554-563, 1992.
16. G. Birkhoff, Tres observaciones sobre el algebra lineal, Universidad Nacional de Tucuman Revista, Serie A, 5, 147-151, 1946.
17. J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, available online from www. ecp6. jussieu. fr/pageperso/bondy/books/gtwa/gtwa. html.
18. O. Boruvka, O jistém problému minimálním (About a certain minimal problem) (in Czech, German summary), Prace mor. prirodoved. spol. v Brne III 3: 37-58.
19. S. C. Boyd, W. R. Pulleyblank, Optimizing over the subtour polytope of the travelling salesman problem, Mathematical Programming, 2, 163-187, 1990.
20. J. Byrka, F. Grandoni, T. Rothvos, L. Sanita, An improved LP-based approximation for Steiner trees, in Proceedings of the 42nd Symposium on the Theory of Computing (STOC), 583-592, 2010.
21. N. Bshouty, L. Burroughs, Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem, in Proceedings of the 15th Annual Symposium on the Theoretical Aspects of Computer Science (STACS), 298-308, 1998.
22. M. C. Cai, X. Deng, W. Zang, A min-max theorem on feedback vertex sets, Mathematics of Operation Research, 27, 361-371, 2002.
23. D. Chakrabarty, G. Goel, On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP, in Proceedings of the 49th Annual Symposium on Foundations of Computer Science (FOCS), 687-696, 2008.
24. D. Chakrabarty, J. Konemann, D. Pritchard, Integrality gap of the hypergraphic relaxation of Steiner trees: a short proof of a 1. 55 upper bound, arXiv: 1006. 2249v1, June 2010.
25. Y. H. Chan, W. S. Fung, L. C. Lau, C. K. Yung, Degree bounded network design with metric costs, in Proceedings of the 49thAnnual IEEE Symposium on Foundations of Computer Science (FOCS), 125-134, 2008.
26. Y. H. Chan, L. C. Lau, On linear and semidefinite programming relaxations for hypergraph matching, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1500-1511, 2010.
27. B. Chandra, M. Halldorsson, Greedy local improvement and weighted set packing approximation, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 169-176, 1999.
28. J. Cheriyan, S. Vempala, A. Vetta, Network design via iterative rounding of setpair relaxations, Combinatorica 26(3), 255-275, 2006.
29. V. Chvatal, Linear Programming, Freeman, 1983.
30. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, A. Schrijver, Combinatorial Optimization, JohnWiley and Sons, 1998.
31. W. H. Cunningham, Testing membership in matroid polyhedra, J. Combinatorial Theory B, 36, 161-188, 1984.
32. W. H. Cunningham, A. B. Marsh, A primal algorithm for optimum matching, (in Polyhedral Combinatorics-Dedicated to the memory of D. R. Fulkerson) Mathematical Programming Study, 8, 50-72, 1978.
33. Y. Dinitz, N. Garg, M. Goemans, On the single-source unsplittable flow problem, Combinatorica, 19, 1-25, 1999.
34. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices, Journal of Research National Bureau of Standards Section B, 69, 125-130, 1965.
35. J. Edmonds, Paths, trees and flowers, Canadian Journal of Mathematics, 17, 449-467, 1965.
36. J. Edmonds, Optimum branchings, Journal of Research National Bureau of Standards Section B, 71, 233-240, 1967.
37. J. Edmonds, Submodular functions, matroids, and certain polyhedra, in Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, Gordon and Breach, New York, 69-87, 1969.
38. J. Edmonds, Matroids and the greedy algorithm, Mathematical Programming, 1, 125-136, 1971.
39. J. Edmonds, R. Giles, A min-max relation for submodular functions on graphs, Annals of Discrete Mathematics, 1, 185-204, 1977.
40. J. Egervary, Matrixok kombinatorius tulajdonsagairol, [in Hungarian: On combinatorial properties of matrices] Matematikaies Fizikai Lapok, 38, 16-28, 1931.
41. S. P. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, N. Young A networkflow technique for finding low-weight bounded-degree trees, Journal of Algorithms 24(2), 310-324, 1997.
42. W. Fernandez de la Vega, G. S. Lueker, Bin packing can be solved within 1+ in linear time, Combinatorica, 1, 349-355, 1981.
43. L. Fleischer, K. Jain, D. P. Williamson, Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, Journal of Computer System and Science, 72(5), 838-867, 2006.
44. A. Frank, Orientations of graphs and submodular flows, Congr. Numer., 113, 111-142, 1996. Festschrift for C. St. J. A. Nash-Williams.
45. A. Frank, Rooted k-connections in digraphs, Discrete Applied Mathematics, 157, 1242-1254, 2009.
46. A. Frank, E. Tardos, An application of submodular flows, Linear Algebra and Its Applications, 114/115, 329-348, 1989.
47. A. M. Frieze, Personal communication, March 2007.
48. G. Frobenius, Über zerlegbare Determinanten, Sitzungsber, Konig. Preuss. Akad. Wiss. XVIII, 274-277, Jbuch. 46. 144, 1917.
49. T. Fukunaga, H. Nagamochi, Network design with weighted degree constraints, in Proceedings ofWorkshop onAlgorithms and Computation (WAOA), 214-225, 2009.
50. S. Fujishige, Submodular Functions and Optimization, 2nd edition, Elsevier, 2005.
51. Z. Furedi, Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica 1(2), 155-162, 1981.
52. Z. Furedi, J. Kahn, P. Seymour, On the fractional matching polytope of a hypergraph, Combinatorica, 13(2), 167-180, 1993.
53. M. Furer, B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, Journal of Algorithms, 17(3), 409-423, 1994.
54. H. N. Gabow, On the L∞-norm of extreme points for crossing supermodular directed network LPs, in Proceedings of Integer Programming and Combinatorial Optimization (IPCO), 392-406, 2005.
55. H. N. Gabow, Upper degree-constrained partial orientations, In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), 554-563, 2006.
56. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
57. R. Garg, V. Kumar, V. Pandit, Approximation algorithms for budget-constrained auctions, in Proceedings of Approximation Algorithms for Combinatorial Optimization (APPROX), 102-113, 2001.
58. N. Garg, V. V. Vazirani, M. Yannakakis, Multiway cuts in directed and node weighted graphs, in Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (ICALP), 487-498, 1994.
59. M. X. Goemans, Minimum bounded-degree spanning trees, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 273-282, 2006.
60. M. X. Goemans, D. P. Williamson, The primal-dual method for approximation algorithms and its application to network design problems, Approximation Algorithms for NP-Hard problems, PWS Publishing Co., 1996.
61. R. L. Graham, P. Hell, On the history of the minimum spanning tree problem, Annals of the History of Computing, 7, 43-57, 1985.
62. R. Gandhi, S. Khuller, A. Srinivasan, Approximation algorithms for partial covering problems, in Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 225-236, 2001.
63. M. Ghodsi, H. Mahini, K. Mirjalali, S. O. Gharan, A. S. Sayedi-Roshkhar, M. Zadimoghaddam, Spanning trees with minimum weighted degrees, Information Processessing Letters, 104(3), 113-116, 2007.
64. F. Grandoni, R. Ravi, M. Singh, Iterative rounding for multi-objective optimization problems, in Proceedings of European Symposim on Algorithms, 95-106, 2009.
65. V. S. Grinberg, S. V. Sevastyanov, The value of the Steinitz constant, Funk. Anal. Prilozh., 14, 56-57, 1980. (in Russian).
66. C. Gropl, S. Hougardy, T. Nierof, H. J. Proomel, Approxiamtion algorithms for the Steiner tree problems in graphs, in X. C. Heng and D. Z. Du, editors, Steiner Trees in Industries, 253-279, Kluwer Academic, 2001.
67. M. Grotschel, L. Lovasz, A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1, 169-197, 1981.
68. M. Grotschel, L. Lovasz, A. Schrijver, Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization," Combinatorica, 4, 291-295, 1984.
69. I. Hajirasouliha, H. Jowhari, R. Kumar, R. Sundaram, On completing Latin squares, in Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS), 524-535, 2007.
70. M. Held, R. M. Karp, The traveling-salesman problem and minimum spanning trees, Operations Research, 18, 1138-1162, 1970.
71. F. S. Hillier, G. J. Lieberman, Introduction to Operations Research, (6th edition), Mcgraw-Hill, 1995.
72. C. A. J. Hurkens, A. Schrijver, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM Journal on Discrete Mathematics, 2(1), 68-72, 1989.
73. S. Iwata, Submodular function minimization, Math. Programming, Ser. B, 112(1), 45-64, 2008.
74. S. Iwata, L. Fleischer, S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the Association for Computing Machinery (JACM), 48, 761-777, 2001.
75. K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21, 39-60, 2001. (Preliminary version in Proc. 39th IEEE FOCS, 1998.).
76. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373-395, 1984.
77. N. Karmarkar, R. Karp, An efficient approximation scheme for the one dimensional bin-packing problem, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS), 312-320, 1982.
78. L. G. Khachian, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244, 1093-1096, 1979. (English translation in Soviet Math. Dokl. 20, 191-194, 1979.).
79. S. Khanna, J. Naor, F. B. Shepherd, Directed network design with orientation constraints, SIAM Journal on Discrete Mathematics, 19(1), 245-257, 2005.
80. T. Kiraly, L. C. Lau, M. Singh, Degree bounded matroids and submodular flows, in Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO), 259-272, 2008.
81. J. M. Kleinberg, Single-source unsplittable flow, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 68!V77, 1996.
82. S. G. Kolliopoulos, C. Stein, Approximation algorithms for single-source unsplittable flow, SIAM Journal on Computing, 31(3), 916-946, 2001.
83. J. Konemann, O. Parekh, D. Pritchard, Max-weight integral multicommodity flow in spiders and high-capacity trees, in Proceedings ofWorkshop onApproximation and Online Algorithms (WAOA), 1-14, 2008.
84. D. Konig, Gráfok és mátrixok. Matematikai es Fizikai Lapok 38: 116-119, 1931.
85. M. Krivelevich, On a conjecture of Tuza about packing and covering of triangles, Discrete Mathematics, 142, 281-286, 1995.
86. J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, in Proceedings of the American Mathematical Society, 7(1), 48-60, 1956.
87. H. W. Kuhn, The Hungarian Method for the assignment problem, Naval Research Logistic Quarterly, 2, 83-97, 1955.
88. L. C. Lau, S. Naor, M. Salavatipour, M. Singh, Survivable network design with degree or order constraints, in Proceedings of the 40th ACM Symposium on Theory of Computing (STOC), 651-660, 2007.
89. L. C. Lau, M. Singh, Additive approximation for bounded degree survivable network design, in Proceedings of the 41st ACM Symposium on Theory of Computing (STOC), 759-768, 2008.
90. J. K. Lenstra, D. B. Shmoys, E. Tardos, Approximation algorithms tor scheduling unrelated parallel machines, Mathematical Programming, 46, 259-271, 1990.
91. J. H. Lin, J. S. Vitter, Approximations with minimum packing constraint violation, in Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC), 771-782, 1992.
92. A. Louis, N. K. Vishnoi Improved algorithm for degree bounded survivable network design problem, in Proceedings of 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 408-419, 2010.
93. L. Lovasz, On two minimax theorems in graphs, Journal of Combinatorial Theory, Series B, 21, 96-103, 1976.
94. L. Lovasz, Submodular functions and convexity, in A. Bachem, M. Grotschel, and B. Korte, ed., Mathematical Programming-The State of the Art, Springer, 235-257, 1983.
95. C. L. Lucchesi, D. H. Younger, A minimax theorem for directed graphs, Journal of the London Mathematical Society, 17(2), 369-374, 1978.
96. J. Matoušek, J. Nešetřil, An Invitation to Discrete Mathematics, Oxford University Press, 2nd edition, 2008.
97. V. Melkonian, E. Tardos, Algorithms for a network design problem with crossing supermodular demands, Networks, 43(4), 256-265, 2004.
98. K. Menger, Zur allgemeinen kurventheorie, Fund. Math. 10, 96-115, 1927.
99. M. Molloy, B. Reed, Graph Colouring and the Probabilisitc Method, Springer Series in Algorithms and Combinatorics 23, 2002.
100. J. Munkres, Algorithms for assignment and transportation problems, Journal of the Society for Industrial and Applied Mathematics, 5, 32-38, 1957.
101. H. Nagamochi, T. Ibaraki, A note on minimizing submodular functions, Information Processing Letters, 67, 239-244, 1998.
102. H. Nagamochi, T. Ibaraki, Polyhedral structure of submodular and posi-modular systems, Lecture Notes in Computer Science 1533, Springer-Verlag, Kyung-Yong Chwa and Oscar H. Ibara (Eds.), Algorithms and Computation, 9th International Symposium (ISAAC), 169-178, 1998.
103. V. Nagarajan, R. Ravi, M. Singh, Simpler analysis of LP extreme points for traveling salesman and survivable network design problems, Operations Research Letter, 38(3), 156-160, 2010.
104. C. St. J. A. Nash-Williams. Edge disjoint spanning trees of finite graphs, J. London Math. Soc., 36, 445-450, 1961.
105. G. L. Nemhauser, L. E. Trotter, Vertex packings: structural properties and algorithms, Mathematical Programming, 8, 232-248, 1975.
106. G. L. Nemhauser, L. A. Wolsey, Integer and Combinatorial Optimization, Wiley-Interscience, 1999.
107. T. Nguyen, A simple LP relaxation for the asymmetric traveling salesman problem, in Proceedings of InternationalWorkshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 207-218, 2008.
108. Z. Nutov, Approximating directed weighted-degree constrained networks, in Proceedings of InternationalWorkshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 219-232, 2008.
109. M. W. Padberg, M. R. Rao, Odd minimum cut-sets and b-matchings, Mathematics of Operations Research, 7, 67-80, 1982.
110. D. Pritchard, Approximability of sparse integer programs, in Proceedings of European Symposium of Algorithms (ESA), 83-94, 2009.
111. R. C. Prim, Shortest connection networks and some generalisations, in Bell System Technical Journal, 36, 1389-1401, 1957.
112. M. Queyranne, Minimizing symmetric submodular functions, Mathematical Programming, 82, 3-12, 1998.
113. R. Ravi, M. X. Goemans, The constrained minimum spanning tree problem, in Proceedings of Fifth Scandinavian Workshop on Algorithm Theory (SWAT), 66-75, 1996.
114. H. E. Robbins, A theorem on graphs with an application to a problem of traffic control, American Mathmatics Monthly, 46, 281-283, 1939.
115. G. Robins, A. Zelikovsky, Tighter bounds for graph Steiner tree approximation, SIAM Journal on Discrete Mathematics, 19(1), 122-134, 2005.
116. B. Saha, A. Srinivasan, A new approximation technique for resource-allocation problems, in Proceedings of FirstAnnual Symposium on Innovations in Computer Science (ICS), 342-357, 2010.
117. P. Sasatte, Improved approximation algorithm for the feedback set problem in a bipartite tournament, Operations Research Letters 36(5), 602-604, 2008.
118. A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B, 80, 346-355, 2000.
119. A. Schrijver, On the history of combinatorial optimization (till 1960), Handbook of Discrete Optimization, 24, Eds. K. Aardal, G. L. Nemhauser and R. Weismantel, 2005.
120. A. Schrijver, Theory of Linear and Integer Progamming, Wiley, 1998.
121. A. Schrijver, Combinatorial Optimization-Polyhedra and Efficiency, Springer-Verlag, New York, 2005.
122. D. Shmoys, E. Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming, 62(3), 461-474, 1993.
123. M. Skutella, Approximating the single-source unsplittable min-cost flow problem, Mathematical Programming B, 91(3), 493-514, 2002.
124. M. Singh, Iterative Methods in Combinatorial Optimization, Ph. D. thesis, Carnegie Mellon University, 2008.
125. M. Singh, L. C. Lau, Approximating minimum bounded degree spanning tress to within one of optimal, in Proceedings of 39th ACM Symposium on Theory of Computing (STOC), 661-670, 2007.
126. A. Srinivasan, Budgeted allocations in the full-information setting, in Proceedings of InternationalWorkshop on Approximation Algorithms for Combinatorial Optimization Problems, 247-253, 2008.
127. E. Steinitz, Bedingt konvergente Reihen und konvexe Systeme, J. Reine Ang. Mathematik, 143, 128-175, 1913, ibid., 144, 1-40, 1914, 146, 1-52, 1916.
128. M. A. Trick, Scheduling multiple variable-speed machines, in Proceedings of the 1st Conference on Integer Programming and Combinatorial Optimization (IPCO), 485-494, 1990.
129. W. T. Tutte, Lectures on matroids, Journal of Research National Bureau of Standards Section B, 69, 1-47, 1965. [reprinted in D. McCarthy, R. G. Stanton, editors, Selected Papers of W. T. Tutte vol. II, Charles Babbage Research Centre, 439-496, 1979].
130. A. van Zuylen, Linear programming based approximation algorithms for feedback set problems in bipartite tournaments, Conference on Theory and Applications of Models of Computation, 2009.
131. R. J. Vanderbei, Linear Programming: Foundations and Extensions, 3rd edition, Springer, 2007.
132. V. Vazirani, Approximation Algorithms, Springer, 2001.
133. S. J. Wright, Primal-Dual Interior-Point Methods, SIAM Publications, 1997.
134. A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica, 9, 463-470, 1993.
135. C. Zhang, G. Wang, X. Liu, J. Liu, Approximating scheduling machines with capacity constraints, in Proceedings of 3rd InternationalWorkshop on Frontiers in Algorithms (FAW), 283-292, 2009.