Approximation Algorithms for the Steiner Tree Problem in Graphs-Reference-Cited by-同舟云学术

Approximation Algorithms for the Steiner Tree Problem in Graphs

Published:2001 Issue: Volume: Page:235-279
ISSN:1388-3011
Container-title:Combinatorial Optimization
language:
Short-container-title:

Author:

Gröpl Clemens,Hougardy Stefan,Nierhoff Till,Prömel Hans Jürgen

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4613-0255-1_7.pdf

Reference35 articles.

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, J. ACM 45 (1998), 501–555.

2. G. Baudis, C. Gröpl, S. Hougardy, T. Nierhoff, H.J. Prömel, Approximating minimum spanning sets in hypergraphs and polymatroids, technical report, Humboldt-Universität zu Berlin, 2000.

3. P. Berman and M. Karpinski, On some tighter inapproximability results, Electronic Colloquium on Computational Complexity, report TR98–065, 1998.

4. P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem, J. Algorithms 17 (1994), 381–408.

5. M. Bern, P. Plassmann, The Steiner problem with edge lengths I and 2, Inform. Process. Lett. 32 (1989), 171–176.

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Better-Than-2 Approximation for Weighted Tree Augmentation;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. Solving Steiner trees: Recent advances, challenges, and perspectives;Networks;2020-11-27

3. Strong Steiner Tree Approximations in Practice;ACM Journal of Experimental Algorithmics;2019-12-17

4. Shortest Path Solution to Wireless Sensor Networks Using Edge-Based Three-Point Steiner Tree Concept;Wireless Communication Networks and Internet of Things;2018-05-10

5. Network Design Problems;Algorithms and Combinatorics;2018