A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- 31 October 2000
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 37 (1), 66-84
- https://doi.org/10.1006/jagm.2000.1096
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Improved Low-Degree Testing and its ApplicationsCombinatorica, 2003
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- Class Steiner trees and VLSI-designDiscrete Applied Mathematics, 1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- The rectilinear class Steiner tree problem for intervals on two parallel linesMathematical Programming, 1994
- Poisson approximation for large deviationsRandom Structures & Algorithms, 1990
- There are planar graphs almost as good as the complete graphJournal of Computer and System Sciences, 1989
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- Steiner problem in networks: A surveyNetworks, 1987