Recent results on approximating the Steiner tree problem and its generalizations
Author:
- 1 March 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 235 (1) , 205-216
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems2002
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994
- Multiway cuts in directed and node weighted graphs1994
- Random pseudo-polynomial algorithms for exact matroid problemsJournal of Algorithms, 1992
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- A fast algorithm for Steiner treesActa Informatica, 1981
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967