STEINER TREE PROBLEMS
Authors:
- 1 January 2001
- book chapter
- Published by Springer Nature
- p. 2451-2464
Abstract
No abstract availableKeywords
This publication has 66 references indexed in Scilit:
- Steiner tree problem with minimum number of Steiner points and bounded edge-lengthInformation Processing Letters, 1999
- Thek-Steiner Ratio in the Rectilinear PlaneJournal of Algorithms, 1998
- The Performance of greedy algorithms for the on-line steiner tree and related problemsTheory of Computing Systems, 1995
- A tight lower bound for the Steiner ratio in Minkowski planesDiscrete Mathematics, 1995
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- The multi-weighted Steiner tree problemAnnals of Operations Research, 1991
- The 1-steiner tree problemJournal of Algorithms, 1987
- The steiner ratio conjecture is true for five pointsJournal of Combinatorial Theory, Series A, 1985
- A short proof of a result of Pollak on Steiner minimal treesJournal of Combinatorial Theory, Series A, 1982