Steiner Tree Problems in Telecommunications-Reference-Cited by-同舟云学术

Steiner Tree Problems in Telecommunications

Published: Issue: Volume: Page:459-492
ISSN:
Container-title:Handbook of Optimization in Telecommunications
language:
Short-container-title:

Author:

Voß Stefan

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-30165-5_18.pdf

Reference140 articles.

1. F. Adelstein, G.G. Richard, and L. Schwiebert. Distributed multicast tree generation with dynamic group membership. Computer Communications, 26:1105–1128, 2003.

2. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem in networks. SIAM Journal on Computing, 24:440–456, 1995.

3. M. J. Alexander and G. Robins. A new approach to FPGA routing based on multi-weighted graphs. In Proceedings of the International Workshop on Field-Programmable Gate Arrays, 1994.

4. Y.P. Aneja. An integer linear programming approach to the Steiner problem in graphs. Networks, 10:167–178, 1980.

5. S. Arora. Polynomial-time approximation scheme for Euclidean TSP and other geometric problems. In Proceedings of the Symposium on Foundations of Computer Science, pages 2–11, 1996.

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

1. Memetic Strategies for Network Design Problems;Springer Tracts in Nature-Inspired Computing;2021-08-07

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

3. Integer Programming Approach to the Data Traffic Paths Recovering Problem;Mathematical Optimization Theory and Operations Research;2020

4. Optimal Network Design with End-to-End Service Requirements;Operations Research;2017-06

5. A practical greedy approximation for the directed Steiner tree problem;Journal of Combinatorial Optimization;2016-09-07