Skip to main content
SpringerLink
Log in

Definition and algorithms for reliable steiner tree problem

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper considers a new form of the Steiner tree problem that is more practical and reliable, which we call Reliable Steiner Tree (RST) problem. The authors give a detailed definition for this new problem and design both an exact algorithm and an approximation algorithm for it. The definition is based on the reliability of full components instead of Steiner vertices. The task is thus to find the most reliable full components to make up an optimum reliable Steiner tree. The exact algorithm designed for this problem utilizes a dynamic programming frame. The approximationalgorithm designed in this paper exploits a local search strategy that looks for the best full component according to a selection function at a time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Karp R M, Reducibility Among Combinatorial Problems, Springer US, 1972.

    Book  Google Scholar 

  2. Takahashi H and Matsuyama A, An approximate solution for the Steiner problem in graphs, Math. Jap., 1980, 24(6): 573–577.

    MATH  MathSciNet  Google Scholar 

  3. Zelikovsky A, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica, 1993, 9: 463–470.

    Article  MATH  MathSciNet  Google Scholar 

  4. Berman P and Ramaiyer V, Improved approximations for the Steiner tree problem, Journal of Algorithms, 1994, 17: 381–408.

    Article  MATH  MathSciNet  Google Scholar 

  5. Zelikovsky A, Better approximation bounds for the network and Euclidean Steiner tree problems, Technical report CS-96-06, University of Virginia, 1995.

    Google Scholar 

  6. PrÖmel H J and Steger A, RNC-approximation algorithms for the Steiner problem, Proceedings of STACS 97, Springer Berlin Heidelberg, 1997.

    Google Scholar 

  7. Karpinski M and Zelikovsky A, New approximation algorithms for the Steiner tree problems, J. of Combinatorial Optimization, 1997, 1: 47–65.

    Article  MATH  MathSciNet  Google Scholar 

  8. Hougardy S and PrÖmel H J, A 1.598 approximation algorithm for the Steiner problem in graphs, Proceedings of SODA, Society for Industrial and Applied Mathematics, 1999.

    Google Scholar 

  9. Robins G and Zelikovsky A, Tighter bounds for graph Steiner tree approximation, SIAM J. Discrete Math, 2005, 19(1): 122–134.

    Article  MATH  MathSciNet  Google Scholar 

  10. Byrka J, Grandoni, Fabrizio F, Rothvoβ T, and Sanità L, An improved LP-based approximation for Steiner tree, Proceedings of the 42nd ACM symposium on Theory of computing, ACM, 2010.

    Google Scholar 

  11. Dreyfus S E and Wagner R A, The Steiner problem in graphs, Networks, 1972, 1: 195–207.

    Article  MATH  MathSciNet  Google Scholar 

  12. Deneen L L, Shute G M, and Thomborson C D, A probably fast, provably optimal algorithm for rectilinear Steiner trees, Random Structures and Algorithms, 1994, 5(4): 535–557.

    Article  MATH  MathSciNet  Google Scholar 

  13. Ganley J L, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Discrete Applied Mathematics, 1999, 90(1–3): 161–171.

    Article  MATH  MathSciNet  Google Scholar 

  14. Guo J, Niedermeier R, and Wernicke S, Parameterized complexity of generalized vertex cover problems, Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS), Springer, Berlin Heidelberg, 2005.

    Google Scholar 

  15. Blelloch G E, Dhamdhere K, Halperin E, Ravi R, Schwartz R, and Sridhar S, Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction, Automata, Languages and Programming, Springer, Berlin Heidelberg, 2006.

    Google Scholar 

  16. MÖlle D, Richter S, and Rossmanith P, A Faster Algorithm for the Steiner Tree Problem, Springer, Berlin Heidelberg, 2006.

    Book  Google Scholar 

  17. BjÖrklund A, Husfeldt T, Kaski P, and Koivisto M, Fourier meets MÖbious, fast subset convolution, Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, New York, 2007.

    Google Scholar 

  18. Tang Y, Yang W, and Guo T, Fast partial subset convolution for Steiner Tree Problem, Proceedings of IMECS, Hong Kong, 2013.

    Google Scholar 

  19. FÖβeier U and Kaufmann M, On exact solutions for the rectilinear Steiner tree problem Part 1: Theoretical results, Algorithmica, 2000, 26: 68–9.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Chinese Academy of Sciences, Beijing, 100049, China

    Yaohua Tang, Wenguo Yang & Tiande Guo

Authors
  1. Yaohua Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenguo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tiande Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yaohua Tang.

Additional information

This research was supported by National Natural Science Foundation of China under Grant Nos. 71171189, 71271204, 11101420, and Knowledge Innovation Program of the Chinese Academy of Sciences under Grant No.KGCX2-RW-329.

This paper was recommended for publication by Editor DAI Yuhong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tang, Y., Yang, W. & Guo, T. Definition and algorithms for reliable steiner tree problem. J Syst Sci Complex 28, 876–886 (2015). https://doi.org/10.1007/s11424-014-2120-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-2120-2

Keywords

Search

Navigation