Skip to main content
SpringerLink
Log in

Spider Covering Algorithms for Network Design Problems

  • Chapter
  • First Online:
Combinatorial Optimization and Graph Algorithms

  • 1286 Accesses

Abstract

The spider covering framework was originally proposed by Klein and Ravi (1993) in their attempt to design a tight approximation algorithm for the node-weighted network design problem. In this framework, an algorithm constructs a solution by repeatedly choosing a low-density graph. The analysis based on this framework basically follows from the idea used in the analysis of the well-known greedy algorithm for the set cover problem. After Klein and Ravi, the framework has been sophisticated in a series of studies, and efficient approximation algorithms for numerous network design problems have been proposed. In this article, we survey these studies on the spider covering framework.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. P.N. Klein, R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner trees, in Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, 29 April–1 May (1993), pp. 323–332

    Google Scholar 

  2. P.N. Klein, R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104–115 (1995)

    Google Scholar 

  3. J. Byrka, F. Grandoni, T. Rothvoß, L. Sanità, Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. M.X. Goemans, N. Olver, T. Rothvoß, R. Zenklusen, Matroids and integrality gaps for hypergraphic steiner tree relaxations, in Proceedings of the 44th Symposium on Theory of Computing Conference, STOC, New York, NY, USA, 19 - 22 May (2012), pp. 1161–1176

    Google Scholar 

  5. S. Guha, A. Moss, J. Naor, B. Schieber, Efficient recovery from power outage (extended abstract), in Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, 1-4 May (1999), pp. 574–582

    Google Scholar 

  6. Z. Nutov, Approximating Steiner networks with node-weights. SIAM J. Comput. 39(7), 3001–3022 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Z. Nutov, Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Trans. Algorithms 9(1), 1 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Z. Nutov, Survivable network activation problems. Theor. Comput. Sci. 514, 105–115 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. T. Fukunaga, Covering problems in edge- and node-weighted graphs. Disc. Opt. 20, 40–61 (2016)

    Google Scholar 

  10. D. Bienstock, M.X. Goemans, D. Simchi-Levi, D.P. Williamson, A note on the prize collecting traveling salesman problem. Math. Program. 59, 413–420 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. C. Chekuri, A. Ene, A. Vakilian, Prize-collecting survivable network design in node-weighted graphs, APPROX-RANDOM. Lecture Notes in Computer Science, vol. 7408 (2012), pp. 98–109

    Google Scholar 

  12. T. Fukunaga, Spider covers for prize-collecting network activation problem, in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4-6 Jan (2015), pp. 9–24

    Google Scholar 

  13. D. Panigrahi, Survivable network design problems in wireless networks, in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, CA, USA, 23–25 Jan (2011), pp. 1014–1027

    Google Scholar 

  14. A. Vakilian, Node-weighted prize-collecting survivable network design problems. Master’s thesis, University of Illinois at Urbana-Champaign, 2013

    Google Scholar 

  15. J. Chuzhoy, S. Khanna, An O\((k^{3}\log n)\)-approximation algorithm for vertex-connectivity survivable network design. Theory Comput. 8(1), 401–413 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Z. Nutov, Approximating subset \(k\)-connectivity problems. J. Discret. Algorithms 17, 51–59 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. A. Moss, Y. Rabani, Approximation algorithms for constrained node weighted Steiner tree problems. SIAM J. Comput. 37(2), 460–481 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. J. Könemann, S.S. Sadeghabad, L. Sanità, An LMP \({O}(\log n)\)-approximation algorithm for node weighted prize collecting Steiner tree, in 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, Berkeley, CA, USA, 26–29 Oct (2013), pp. 568–577

    Google Scholar 

  19. M.H. Bateni, M.T. Hajiaghayi, V. Liaghat, Improved approximation algorithms for (budgeted) node-weighted Steiner problems, in Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, 8–12 July 2013, Proceedings, Part I. Lecture Notes in Computer Science, vol. 7965 (2013), pp. 81–92

    Google Scholar 

  20. C. Chekuri, M.T. Hajiaghayi, G. Kortsarz, M.R. Salavatipour, Approximation algorithms for nonuniform buy-at-bulk network design. SIAM J. Comput. 39(5), 1772–1798 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  21. E. Halperin, R. Krauthgamer, Polylogarithmic inapproximability, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11 (2003), pp. 585–594

    Google Scholar 

  22. M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, M. Li, Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73–91 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  23. C. Chekuri, G. Even, A. Gupta, D. Segev, Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms 7(2), 18 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  24. M. Feldman, G. Kortsarz, Z. Nutov, Improved approximation algorithms for directed Steiner forest. J. Comput. Syst. Sci. 78(1), 279–292 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. M. Imase, B.M. Waxman, Dynamic steiner tree problem. SIAM J. Discrete Math. 4(3), 369–384 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  26. J. Naor, D. Panigrahi, M. Singh, Online node-weighted Steiner tree and related problems, in IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22–25 Oct (2011) pp. 210–219

    Google Scholar 

  27. M.T. Hajiaghayi, V. Liaghat, D. Panigrahi, Online node-weighted steiner forest and extensions via disk paintings. . SIAM J. Comput. 46(3), 911–935 (2017)

    Google Scholar 

  28. A. Ene, D. Chakrabarty, R. Krishnaswamy, D. Panigrahi, Online buy-at-bulk network design, in IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 Oct (2015), pp. 545–562

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Japan

    Takuro Fukunaga

Authors
  1. Takuro Fukunaga
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Takuro Fukunaga .

Editor information

Editors and Affiliations

  1. National Institute of Informatics , Tokyo, Japan

    Takuro Fukunaga

  2. National Institute of Informatics , Tokyo, Japan

    Ken-ichi Kawarabayashi

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Fukunaga, T. (2017). Spider Covering Algorithms for Network Design Problems. In: Fukunaga, T., Kawarabayashi, Ki. (eds) Combinatorial Optimization and Graph Algorithms. Springer, Singapore. https://doi.org/10.1007/978-981-10-6147-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6147-9_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6146-2

  • Online ISBN: 978-981-10-6147-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation