Abstract
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.
Due to space limitations, we defer most proofs to the full version of this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)
Bertsimas, D., Teo, C.P., Vohra, R.: On dependent randomized rounding algorithms. Operations Research Letters 24, 105–114 (1999)
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)
Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. Journal of Algorithms 43, 138–152 (2002)
Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology 2, 139–152 (1995)
Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30, 29–42 (1991)
Hassin, R., Segev, D.: The multi-radius cover problem (2004)
Hassin, R., Segev, D.: The set cover with pairs problem (2005)
Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11, 555–556 (1982)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassin, R., Segev, D. (2005). Rounding to an Integral Program. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_6
Download citation
DOI: https://doi.org/10.1007/11427186_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)