Lagrangian Relaxation and Partial Cover

Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.

[1]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[2]  Tim Roughgarden,et al.  Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..

[3]  R. Ravi,et al.  A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.

[4]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[5]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[6]  Toshihide Ibaraki,et al.  Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem , 2000, J. Algorithms.

[7]  Ojas Parekh,et al.  A Unified Approach to Approximating Partial Covering Problems , 2006, Algorithmica.

[8]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[9]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[10]  R. Ravi,et al.  The Constrained Minimum Spanning Tree Problem (Extended Abstract) , 1996, SWAT.

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

[12]  Sanjeev Arora,et al.  A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.

[13]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.

[14]  Gérard Cornuéjols,et al.  Balanced matrices , 2006, Discret. Math..

[15]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[16]  Jeremy P. Spinrad,et al.  Doubly Lexical Ordering of Dense 0 - 1 Matrices , 1993, Inf. Process. Lett..

[17]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[18]  A. Hoffman,et al.  Totally-Balanced and Greedy Matrices , 1985 .

[19]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[20]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[21]  Mohit Singh,et al.  Approximating the k-multicut problem , 2006, SODA '06.

[22]  Refael Hassin,et al.  Rounding to an integral program , 2005, Oper. Res. Lett..

[23]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[24]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[25]  Naveen Garg,et al.  Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.

[26]  Kenneth L. Clarkson,et al.  A Modification of the Greedy Algorithm for Vertex Cover , 1983, Inf. Process. Lett..

[27]  S. Khuller,et al.  Approximation algorithms for partial covering problems , 2001, J. Algorithms.

[28]  Sang-Hyung Ahn,et al.  Computational Comparison of Two Lagrangian Relaxation for the K-median Problem , 1989 .

[29]  Danny Segev,et al.  Partial multicuts in trees , 2005, Theor. Comput. Sci..

[30]  Ojas Parekh,et al.  Path Hitting in Acyclic Graphs , 2007, Algorithmica.

[31]  George Karakostas,et al.  A better approximation ratio for the vertex cover problem , 2005, TALG.

[32]  Dorit S. Hochbaum,et al.  The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints , 1998, APPROX.

[33]  R. Ravi,et al.  A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.

[34]  J. Davenport.  Editor , 1960 .