Faster approximation algorithms for the rectilinear steiner tree problem
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- Fast heuristic algorithms for rectilinear steiner treesAlgorithmica, 1989
- A faster approximation algorithm for the Steiner problem in graphsActa Informatica, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966