A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points-Reference-Cited by-同舟云学术

A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points

Published:2000-09 Issue:4 Volume:75 Page:165-167
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Măndoiu Ion I.,Zelikovsky Alexander Z.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Improved approximations for the Steiner tree problem;Berman;J. Algorithms,1994

2. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, G. Xue, Approximations for Steiner trees with minimum number of Steiner points, March 1999, submitted

3. A threshold of lnn for approximating set cover;Feige;J. ACM,1998

4. Improved methods for approximating node weighted Steiner trees and connected dominating sets;Guha;Inform. and Comput.,1999

5. A nearly best-possible approximation algorithm for node-weighted Steiner trees;Klein;J. Algorithms,1995

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

1. Provably Efficient Security-Aware Service Function Tree Composing and Embedding in Multi-Vendor Networks;2024

2. Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points;Optimization Letters;2023-09-18

3. Combination Algorithms for Steiner Tree Variants;Algorithmica;2022-08-08

4. Approximation Designs for Energy Harvesting Relay Deployment in Wireless Sensor Networks;Journal of Computer Science and Technology;2022-07

5. Restriction and Steiner Tree;Introduction to Combinatorial Optimization;2022