论文信息 - Rounding to an Integral Program

Rounding to an Integral Program

We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as integer covering programs, possibly with additional side constraints. Second, the number of covering options is restricted in some sense, although this property may be well hidden. Our method is a natural extension of the threshold rounding technique.

Refael Hassin | Danny Segev

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

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

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

[4] Dimitris Bertsimas,et al. On dependent randomized rounding algorithms , 1999, Oper. Res. Lett..

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

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

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

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

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

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

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

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