Approximation algorithms for set cover and related problems

In this thesis, we analyze several known and newly designed algorithms for approximating optimal solutions to NP-hard optimization problems. We give a new analysis of the greedy algorithm for approximating the S scET C scOVER and P scARTIAL S scET scCOVER problems obtaining significantly improved performance bounds. We also give a first approximation algorithm with a non-trivial performance bound for the E scRRAND S scCHEDULING and T scREE C scOVER problems, known also as the G scENERALIZED T scRAVELING S scALESMAN and G scROUP S scTEINER T scREE problems. The main results of this thesis first appeared in my papers (87), (89), (91), and (90); and in my technical reports (86) and (88).

[1]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[2]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[3]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[4]  Jack Edmonds,et al.  Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

[5]  D. R. Fulkerson.  NOTES ON COMBINATORIAL MATHEMATICS: ANTI-BLOCKING POLYHEDRA , 1970 .

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[9]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[10]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[11]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[15]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[16]  L. Wolsey.  Heuristic analysis, linear programming and branch and bound , 1980 .

[17]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[18]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[19]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[20]  G. Laporte,et al.  Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .

[21]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[22]  Hartley Rogers.  Theory of recursive functions and effective computability (Reprint from 1967) , 1987 .

[23]  Gilbert Laporte,et al.  Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..

[24]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[25]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.

[26]  Caroline C. Hayes,et al.  A Model of Planning for Plan Efficiency: Taking Advantage of Operator Overlap , 1989, IJCAI.

[27]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[28]  David P. Williamson,et al.  Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..

[29]  Edmund Ihler,et al.  Bounds on the quality of approximate solutions to the Group Steiner Problem , 1990, WG.

[30]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[31]  Michel X. Goemans,et al.  On the parsimonious property of connectivity problems , 1990, SODA '90.

[32]  Michael Kearns,et al.  Computational complexity of machine learning , 1990, ACM distinguished dissertations.

[33]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.

[34]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[35]  Edmund Ihler,et al.  The Complexity of Approximating the Class Steiner Tree Problem , 1991, WG.

[36]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[37]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[38]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[39]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[40]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[41]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[42]  David B. Shmoys,et al.  Computing near-optimal solutions to combinatorial optimization problems , 1994, Combinatorial Optimization.

[43]  Alex Zelikovsky.  A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs , 1993, Inf. Process. Lett..

[44]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[45]  Benjamin W. Wah,et al.  Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem , 1993, Inf. Sci..

[46]  Rajeev Motwani,et al.  Lecture notes on approximation algorithms: Volume I , 1993 .

[47]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[48]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[49]  Edmund Ihler,et al.  The rectilinear class Steiner tree problem for intervals on two parallel lines , 1994, Math. Program..

[50]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[51]  Sreejit Chakravarty,et al.  A study of I/sub DDQ/ subset selection algorithms for bridging faults , 1994, Proceedings., International Test Conference.

[52]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[53]  Santosh S. Vempala,et al.  Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.

[54]  Samir Khuller,et al.  The loading time scheduling problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[55]  Aravind Srinivasan,et al.  Improved approximations of packing and covering problems , 1995, STOC '95.

[56]  Sanjeev Arora.  Probabilistic checking of proofs and hardness of approximation problems , 1995 .

[57]  Magnús M. Halldórsson,et al.  Approximating discrete collections via local improvements , 1995, SODA '95.

[58]  Santosh S. Vempala,et al.  A constant-factor approximation for the k-MST problem in the plane , 1995, STOC '95.

[59]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[60]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[61]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[62]  Gary L. Miller,et al.  Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , 1996, STOC 1996.

[63]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[64]  Matteo Fischetti,et al.  A Heuristic Algorithm for the Set Covering Problem , 1996, IPCO.

[65]  Rong-chii Duh,et al.  Approximation of k-set cover by semi-local optimization , 1997, STOC '97.

[66]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..

[67]  Alex Zelikovsky,et al.  Provably good routing tree construction with multi-port terminals , 1997, ISPD '97.

[68]  Petr Slavik,et al.  The Errand Scheduling Problem , 1997 .

[69]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[70]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[71]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[72]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[73]  U. Feige.  A threshold of ln n for approximating set cover , 1998, JACM.

[74]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[75]  Edmund Ihler,et al.  Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..

[76]  Santosh S. Vempala,et al.  A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..

[77]  Esther M. Arkin,et al.  Minimum-diameter covering problems , 2000 .