Rounding to an integral program

This paper presents a framework for approximating NP-hard problems that can be formulated as integer-covering programs, possibly with additional side constraints, and the number of covering options is restricted in some sense, although this property may be well hidden.

[1]  Arthur F. Veinott,et al.  Optimal Capacity Scheduling---II , 1962 .

[2]  Refael Hassin,et al.  The Set Cover with Pairs Problem , 2005, FSTTCS.

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

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

[5]  Dorit S. Hochbaum.  Instant Recognition of Half Integrality and 2-Approximations , 1998, APPROX.

[6]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[7]  Joseph Cheriyan,et al.  Approximation Algorithms for Feasible Cut and Multicut Problems , 1995, ESA.

[8]  Dimitris Bertsimas,et al.  On Dependent Randomized Rounding Algorithms , 1996, IPCO.

[9]  Refael Hassin,et al.  The Multi-radius Cover Problem , 2005, WADS.

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

[11]  Refael Hassin,et al.  Approximation algorithms for hitting objects with straight lines , 1991, Discret. Appl. Math..

[12]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[13]  Haim Kaplan,et al.  Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..

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

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

[16]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[17]  Frits C. R. Spieksma,et al.  Approximation of Rectangle Stabbing and Interval Stabbing Problems , 2004, ESA.

[18]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[19]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .