Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Applications pp 102–113Cite as

Covering Analysis of the Greedy Algorithm for Partial Cover

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6060))

Abstract

The greedy algorithm is known to have a guaranteed approximation performance in many variations of the well-known minimum set cover problem. We analyze the number of elements covered by the greedy algorithm for the minimum set cover problem, when executed for k rounds. This analysis quite easily yields in the p-partial cover problem over a ground set of m elements the harmonic approximation guarantee H(⌈pm⌉) for the number of required covering sets. Thus, we tie together the coverage analysis of the greedy algorithm for minimum set cover and its dual problem partial cover.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York (1979)

    MATH  Google Scholar 

  3. Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9(3), 256–278 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383–390 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kearns, M.J.: The Computational Complexity of Machine Learning. MIT Press, Cambridge (1990)

    Google Scholar 

  7. Kivinen, J., Mannila, H., Ukkonen, E.: Learning hierarchical rule sets. In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, pp. 37–44. ACM Press, New York (1992)

    Chapter  Google Scholar 

  8. Brazma, A., Jonassen, I., Ukkonen, E., Vilo, J.: Discovering patterns and subfamilies in biosequences. In: States, D.J., Agarwal, P., Gaasterland, T., Hunter, L., Smith, R. (eds.) Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, pp. 34–43. AAAI Press, Menlo Park (1996)

    Google Scholar 

  9. Brazma, A., Ukkonen, E., Vilo, J.: Discovering unbounded unions of regular pattern languages from positive examples. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 95–104. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Li, M.: Towards a DNA sequencing theory. In: Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science, pp. 125–134. IEEE Computer Society, Los Alamitos (1990)

    Chapter  Google Scholar 

  11. Kivioja, T., Arvas, M., Saloheimo, M., Penttilä, M., Ukkonen, E.: Optimization of cDNA-AFLP experiments using genomic sequence data. Bioinformatics 21(11), 2573–2579 (2005)

    Article  Google Scholar 

  12. Rantanen, A., Mielikäinen, T., Rousu, J., Maaheimo, H., Ukkonen, E.: Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Bioinformatics 22(10), 1198–1206 (2006)

    Article  Google Scholar 

  13. Slavík, P.: Improved performance of the greedy algorithm for partial cover. Information Processing Letters 64(5), 251–254 (1997)

    Article  MathSciNet  Google Scholar 

  14. Slavík, P.: A tight analysis of the greedy algorithm for set cover. Journal of Algorithms 25(2), 237–254 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Slavík, P.: Approximation algorithms for set cover and related problems. PhD thesis, State University of New York at Buffalo, Department of Computer Science, Buffalo, NY (April 1998)

    Google Scholar 

  17. Srinivasan, A.: Improved approximation of packing and covering problems. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pp. 268–276. ACM Press, New York (1995)

    Chapter  Google Scholar 

  18. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  19. Halldórsson, M.M.: Approximating set cover via local search. Technical Report IS-RR-95-0002F, Japan Advanced Institute of Science and Technology (1995)

    Google Scholar 

  20. Halldórsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 160–169. ACM Press, New York (1995)

    Google Scholar 

  21. Duh, R., Fürer, M.: Approximation of k-set cover by semi-local optimization. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 256–264. ACM Press, New York (1997)

    Chapter  Google Scholar 

  22. Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, pp. 94–143. PSW Publishing, Boston (1997)

    Google Scholar 

  23. Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach of maximum k-coverage. Naval Research Quarterly 45, 615–627 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  24. Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555–556 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  25. Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385–393 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  26. Hochbaum, D.S.: The t-vertex cover problem: Extending the half integrality framework with budget constraints. In: Jansen, K., Hochbaum, D.S. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 111–122. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  27. Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. Journal of Algorithms 39(2), 137–144 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  28. Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. Journal of Algorithms 53(1), 55–84 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  29. Sümer, Ö.: Partial covering of hypergraphs. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 572–585. SIAM, Philadelphia (2005)

    Google Scholar 

  30. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: Proceedings of the Eleventh ACM-SIAM Symposium on Discrete Algorithms, pp. 345–353. SIAM, Philadelphia (2000)

    Google Scholar 

  31. Peleg, D.: Approximation algorithms for the label-cover\(_{\mbox{max}}\) and red-blue set cover problems. J. Discrete Algorithms 5(1), 55–64 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  32. Miettinen, P.: On the positive-negative partial set cover problem. Information Processing Letters 108(4), 219–221 (2008)

    Article  MathSciNet  Google Scholar 

  33. Fujito, T., Kurahashi, H.: A better-than-greedy algorithm for k-set multicover. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 176–189. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  34. Berman, P., DasGupta, B., Sontag, E.D.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Applied Mathematics 155(6-7), 733–749 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  35. Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multi-cover problem in geometric settings. In: Hershberger, J., Fogel, E. (eds.) Proceedings of the 25th ACM Symposium on Computational Geometry, pp. 341–350. ACM, New York (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Systems, Tampere University of Technology, P.O. Box 553, FI-33101, Tampere, Finland

    Tapio Elomaa & Jussi Kujala

Authors
  1. Tapio Elomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jussi Kujala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Systems, Tampere University of Technology, P. O. Box 553, 33101, Tampere, Finland

    Tapio Elomaa

  2. Department of Information and Computer Science, Aalto University School of Science and Technology, P.O. Box 17800, 00076, Aalto, Finland

    Heikki Mannila

  3. Department of Information and Computer Science, Aalto University School of Science and Technology, P.O. Box 15400, 00076, Aalto, Finland

    Pekka Orponen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Elomaa, T., Kujala, J. (2010). Covering Analysis of the Greedy Algorithm for Partial Cover. In: Elomaa, T., Mannila, H., Orponen, P. (eds) Algorithms and Applications. Lecture Notes in Computer Science, vol 6060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12476-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12476-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12475-4

  • Online ISBN: 978-3-642-12476-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation