Skip to main content
SpringerLink
Log in

Approximation Algorithms in the Successive Hitting Set Model

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2015)

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

Included in the following conference series:

  • 1136 Accesses

Abstract

We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and experimentally investigate, several scenarios where the new model is beneficial compared to the conventional one.

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

Access this chapter

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

Institutional subscriptions

Notes

  1. 1.

    openstreetmap.org.

References

  1. Mustafa, N.H., Ray, S.: Ptas for geometric hitting set problems via local search. In: Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry, pp. 17–22. ACM (2009)

    Google Scholar 

  2. Hefeeda, M., Bagheri, M.: Randomized k-coverage algorithms for dense sensor networks. In: IEEE 26th IEEE International Conference on Computer Communications, INFOCOM 2007, pp. 2376–2380. IEEE (2007)

    Google Scholar 

  3. Eisner, J., Funke, S.: Transit nodes-lower bounds and refined construction. In: ALENEX, SIAM, pp. 141–149 (2012)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Slavík, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 435–441. ACM (1996)

    Google Scholar 

  6. Alon, N., Awerbuch, B., Azar, Y.: The online set cover problem. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 100–105. ACM (2003)

    Google Scholar 

  7. Vinterbo, S., Øhrn, A.: Minimal approximate hitting sets and rule templates. Int. J. Approximate Reasoning 25(2), 123–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Funke, S., Nusser, A., Storandt, S.: On k-path covers and their applications. Proc. VLDB Endow. 7(10), 893–902 (2014)

    Article  Google Scholar 

  9. Funke, S., Nusser, A., Storandt, S.: Placement of loading stations for electric vehicles: no detours necessary! In: Twenty-Eighth AAAI Conference on Artificial Intelligence (2014)

    Google Scholar 

  10. Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321–333. Springer, Heidelberg (2014)

    Google Scholar 

  11. Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(1), 463–479 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Matoušek, J., Seidel, R., Welzl, E.: How to net a lot with little: small epsilon-nets for disks and halfspaces. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 16–22. ACM (1990)

    Google Scholar 

  13. Even, G., Rawitz, D., Shahar, S.M.: Hitting sets when the VC-dimension is small. Inf. Process. Lett. 95(2), 358–362 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-dimension and shortest path algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 690–699. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Freiburg, Freiburg im Breisgau, Germany

    Sabine Storandt

Authors
  1. Sabine Storandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sabine Storandt .

Editor information

Editors and Affiliations

  1. Masdar Institute, Abu Dhabi, United Arab Emirates

    Khaled Elbassioni

  2. Kyoto University, Kyoto, Japan

    Kazuhisa Makino

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Storandt, S. (2015). Approximation Algorithms in the Successive Hitting Set Model. In: Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science(), vol 9472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48971-0_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48971-0_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48970-3

  • Online ISBN: 978-3-662-48971-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation