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.
Unable to display preview. Download preview PDF.
- 3.Dinur, I., Safra, S.: The importance of being biased. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 33–42 (2002)Google Scholar
- 7.Hassin, R., Segev, D.: The multi-radius cover problem (2004)Google Scholar
- 8.Hassin, R., Segev, D.: The set cover with pairs problem (2005)Google Scholar
- 10.Hochbaum, D.S.: Instant recognition of half integrality and 2-approximations. In: Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 99–110 (1998)Google Scholar
- 11.Kovaleva, S., Spieksma, F.C.R.: Approximation of rectangle stabbing and interval stabbing problems. In: Proceedings of the 12th Annual European Symposium on Algorithms, pp. 426–435 (2004)Google Scholar
- 12.Yu, B., Cheriyan, J.: Approximation algorithms for feasible cut and multicut problems. In: Proceedings of the 3rd Annual European Symposion on Algorithms, pp. 394–408 (1995)Google Scholar