Rounding to an Integral Program

  • Refael Hassin
  • Danny Segev
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)


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.

Unable to display preview. Download preview PDF.


  1. 1.
    Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bertsimas, D., Teo, C.P., Vohra, R.: On dependent randomized rounding algorithms. Operations Research Letters 24, 105–114 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 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
  4. 4.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30, 29–42 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Hassin, R., Segev, D.: The multi-radius cover problem (2004)Google Scholar
  8. 8.
    Hassin, R., Segev, D.: The set cover with pairs problem (2005)Google Scholar
  9. 9.
    Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11, 555–556 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Refael Hassin
    • 1
  • Danny Segev
    • 1
  1. 1.School of Mathematical SciencesTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations