Skip to main content
SpringerLink
Log in

Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2011)

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

Abstract

The source location problem is a problem of computing a minimum cost source set in an undirected graph so that the connectivity between the source set and each vertex is at least the demand of the vertex. In this paper, the connectivity between a source set S and a vertex v is defined as the maximum number of paths between v and S no two of which have common vertices except v. We propose an O(d  ∗ log d  ∗ )-approximation algorithm for the problem with maximum demand d  ∗ . We also define a variant of the source location problem and propose an approximation algorithm for it.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arata, K., Iwata, S., Makino, K., Fujishige, S.: Locating sources to meet flow demands in undirected networks. Journal of Algorithms 42, 54–68 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. Journal of Computer and System Sciences 72, 838–867 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ishii, T., Fujita, H., Nagamochi, H.: The source location problem with local 3-vertex-connectivity requirements. Discrete Applied Mathematics 155, 2523–2538 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ishii, T., Fujita, H., Nagamochi, H.: Minimum cost source location problem with local 3-vertex-connectivity requirements. Theoretical Computer Science 372, 81–93 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ishii, T.: Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. Journal of Discrete Algorithms 7, 570–578 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ito, H., Ito, M., Itatsu, Y., Uehara, H., Yokoyama, M.: Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40, 63–70 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jain, K.: Factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 39–60 (2001)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. In: 40th ACM Symposium on Theory of Computing, pp. 759–768 (2008)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Nagamochi, H., Ishii, T., Ito, H.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Information Processing Letters 80, 287–294 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Nutov, Z.: Approximating minimum cost connectivity problems via uncrossable bifamilies and spider-cover decompositions. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 417–426 (2009)

    Google Scholar 

  14. Sakashita, M., Makino, K., Fujishige, S.: Minimizing a monotone concave function with laminar covering constraints. Discrete Applied Mathematics 156, 2004–2019 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sakashita, M., Makino, K., Fujishige, S.: Minimum cost source location problems with flow requirements. Algorithmica 50, 555–583 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)

    MATH  Google Scholar 

  17. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: 39th ACM Symposium on Theory of Computing, pp. 661–670 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga

Authors
  1. Takuro Fukunaga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Miami, 1365 Memorial Drive, 33146, Coral Gables, FL, USA

    Mitsunori Ogihara

  2. Department of Information and Communication Engineering, University of Electro-Comm, Chofugaoga 1-5-1, Chofu, 182-8585, Tokyo, Japan

    Jun Tarui

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fukunaga, T. (2011). Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. In: Ogihara, M., Tarui, J. (eds) Theory and Applications of Models of Computation. TAMC 2011. Lecture Notes in Computer Science, vol 6648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20877-5_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20877-5_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20876-8

  • Online ISBN: 978-3-642-20877-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation