Skip to main content
Springer Nature Link
Log in

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree

  • Conference paper
  • First Online:
Automata, Languages, and Programming (ICALP 2015)

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

Included in the following conference series:

Abstract

In the Steiner tree problem, we are given as input a connected \(n\)-vertex graph with edge weights in \(\{1,2,\ldots ,W\}\), and a subset of \(k\) terminal vertices. Our task is to compute a minimum-weight tree that contains all the terminals. We give an algorithm for this problem with running time \({\mathcal O}(7.97^k\cdot n^4\cdot \log {W})\) using \({\mathcal O}(n^3\cdot \log {nW} \cdot \log k)\) space. This is the first single-exponential time, polynomial-space FPT algorithm for the weighted Steiner Tree problem.

The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreements 267959, 338077 and 306992

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Basavaraju, M., Fomin, F.V., Golovach, P., Misra, P., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms to preserve connectivity. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 800–811. Springer, Heidelberg (2014)

    Google Scholar 

  2. Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171–176 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 67–74. ACM, New York (2007)

    Google Scholar 

  4. Blelloch, G.E., Dhamdhere, K., Halperin, E., Ravi, R., Schwartz, R., Sridhar, S.: Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 667–678. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bodlaender, H.L.: A partial \(k\)-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(1–2), 1–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer (2013)

    Google Scholar 

  8. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195–207 (1971)

    Article  MathSciNet  Google Scholar 

  9. Fomin, F.V., Grandoni, F., Kratsch, D., Lokshtanov, D., Saurabh, S.: Computing optimal Steiner trees in polynomial space. Algorithmica 65(3), 584–604 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fuchs, B., Kern, W., Mölle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum Steiner trees. Theory of Computing Systems 41(3), 493–500 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36–48. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 321–330. ACM (2010)

    Google Scholar 

  13. Nederlof, J.: Fast polynomial-space algorithms using inclusion-exclusion. Algorithmica 65(4), 868–884 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Subexponential-time parameterized algorithm for Steiner tree on planar graphs. In: Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol. 20, pp. 353–364. Dagstuhl, Germany (2013)

    Google Scholar 

  15. Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Network sparsification for Steiner problems on planar and bounded-genus graphs. In: Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 276–285. IEEE (2014)

    Google Scholar 

  16. Prömel, H.J., Steger, A.: The Steiner Tree Problem. Advanced Lectures in Mathematics. Friedr. Vieweg & Sohn, Braunschweig (2002)

    Book  MATH  Google Scholar 

  17. Robbins, H.: A remark on Stirling’s formula. Amer. Math. Monthly 62, 26–29 (1955)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bergen, Bergen, Norway

    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan & Saket Saurabh

  2. Aalto University, Espoo, Finland

    Petteri Kaski

  3. Institute of Mathematical Sciences, Chennai, India

    Fahad Panolan & Saket Saurabh

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petteri Kaski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Lokshtanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fahad Panolan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fahad Panolan .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fomin, F.V., Kaski, P., Lokshtanov, D., Panolan, F., Saurabh, S. (2015). Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47672-7_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47671-0

  • Online ISBN: 978-3-662-47672-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics