Skip to main content
Springer Nature Link
Log in

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

  • Conference paper
Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

  • 1889 Accesses

Abstract

We initiate a systematic parameterized complexity study of three fundamental network design problems on arc-weighted directed graphs: Directed Steiner Tree, Strongly Connected Steiner Subgraph, and Directed Steiner Network. We investigate their parameterized complexities with respect to the parameters “number of terminals”, “an upper bound on the size of the connecting network”, and the combination of both. We achieve several parameterized hardness as well as some fixed-parameter tractability results, in this way significantly extending previous results of Feldman and Ruhl [SIAM J. Comp. 2006].

Main work done while all authors were with Friedrich-Schiller-Universität Jena.

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

Access this chapter

Log in via an institution

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. Arkin, E.M., Hassin, R., Shahar, S.: Increasing digraph arc-connectivity by arc addition, reversal and complement. Discrete Appl. Math. 122(1-3), 13–22 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563–574. Springer, Heidelberg (2008); Long version to appear in J. Comput. Syst. Sci.

    Chapter  Google Scholar 

  3. Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: Proc. 23rd ICDE, pp. 836–845. IEEE, Los Alamitos (2007)

    Google Scholar 

  4. Dodis, Y., Khanna, S.: Design networks with bounded pairwise distance. In: Proc. 31th STOC, pp. 750–759. ACM, New York (1999)

    Google Scholar 

  5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  6. Dreyfus, S., Wagner, R.: The Steiner problem in graphs. Networks 1, 195–207 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  7. Feldman, J., Ruhl, M.: The directed Steiner network problem is tractable for a constant number of terminals. SIAM J. Comput. 36(2), 543–561 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53–61 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. CRC, Boca Raton (2007)

    Google Scholar 

  10. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität des Saarlandes, Campus E 1.4, D-66123, Saarbrücken, Germany

    Jiong Guo

  2. Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743, Jena, Germany

    Rolf Niedermeier

  3. Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00, Praha, Czech Republic

    Ondřej Suchý

Authors
  1. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondřej Suchý
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, J., Niedermeier, R., Suchý, O. (2009). Parameterized Complexity of Arc-Weighted Directed Steiner Problems. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics