Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2004: Algorithms – ESA 2004 pp 180–191Cite as

Hardness and Approximation Results for Packing Steiner Trees

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3221))

Abstract

We study approximation algorithms and hardness of approximation for several versions of the problem of packing Steiner trees. For packing edge-disjoint Steiner trees of undirected graphs, we show APX-hardness for 4 terminals. For packing Steiner-node-disjoint Steiner trees of undirected graphs, we show a logarithmic hardness result, and give an approximation guarantee of \(O(\sqrt{n}\log n)\), where n denotes the number of nodes. For the directed setting (packing edge-disjoint Steiner trees of directed graphs), we show a hardness result of \(\Omega(m^{\frac{1}{3}-\epsilon})\) and give an approximation guarantee of \(O(m^{\frac{1}{2}+\epsilon})\), where m denotes the number of edges. The paper has several other results.

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   84.99
Price excludes VAT (USA)
  • Available as 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

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. Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, PWS Publishing (1996)

    Google Scholar 

  2. Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research 25, 255–280 (1997); Earlier version in FOCS 1997 (1997)

    Article  MathSciNet  Google Scholar 

  3. Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problem. J. Algorithms 33(1), 73–91 (1999); Earlier version in SODA 1998 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Charikar, M., Naor, J., Schieber, B.: Resource optimization in QoS multicast routing of real-time multimedia. In: Proc. 19th Annual IEEE INFOCOM (2000)

    Google Scholar 

  5. Diestel, R.: Graph Theory. Springer, New York (2000)

    Google Scholar 

  6. Feige, U., Halldorsson, M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. Siam J. Computing 32(1), 172–195 (2002); Earlier version in STOC 2000 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Floréen, P., Kaski, P., Kohonen, J., Orponen, P.: Multicast time maximization in energy constrained wireless networks. In: Proc. 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2003), San Diego, CA (2003)

    Google Scholar 

  8. Frank, A., Király, T., Kriesell, M.: On decomposing a hypergraph into k connected subhypergraphs. Discrete Applied Mathematics 131(2), 373–383 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Computer and System Sciences 67(3), 473–496 (2003); Earlier version in STOC 1999 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10(2), 111–121 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  11. Grötschel, M., Martin, A., Weismantel, R.: The Steiner tree packing problem in VLSI design. Mathematical Programming 78, 265–281 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Guha, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Information and Computation 150, 57–74 (1999); Earlier version in FST&TCS 1998 (1998)

    Article  MathSciNet  Google Scholar 

  13. Hazan, E., Safra, S., Schwartz, O.: On the hardness of approximating kdimensional matching, Electronic Colloqium on Computational Complexity, Rep. No. 20 (2003)

    Google Scholar 

  14. Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: Proc. SODA 2003 (2003)

    Google Scholar 

  15. Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37, 27–35 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kaski, P.: Packing Steiner trees with identical terminal sets. Information Processing Letters 91(1), 1–5 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using packing integer programs. Mathematical Programming 99, 63–87 (2004); Earlier version in Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.): IPCO 1998. LNCS, vol. 1412. Springer, Heidelberg (1998)

    Google Scholar 

  18. Kratochvil, J., Tuza, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40–54 (2002); Earlier version in SODA 2000 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kriesell, M.: Edge-disjoint trees containing some given vertices in a graph. J. Combinatorial Theory (B) 88, 53–65 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lau, L.C.: An approximate max-Steiner-tree-packing min-Steiner-cut theorem (2004) (manuscript)

    Google Scholar 

  21. Martin, A., Weismantel, R.: Packing paths and Steiner trees: Routing of electronic circuits. CWI Quarterly 6, 185–204 (1993)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L3G1, Canada

    Joseph Cheriyan

  2. Department of Computing Science, University of Alberta, Edmonton, Alberta, T6G2H1, Canada

    Mohammad R. Salavatipour

Authors
  1. Joseph Cheriyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad R. Salavatipour
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer Science, King’s College, WC2R 2LS, London, UK

    Tomasz Radzik

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheriyan, J., Salavatipour, M.R. (2004). Hardness and Approximation Results for Packing Steiner Trees. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30140-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23025-0

  • Online ISBN: 978-3-540-30140-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation