A greedy approximation algorithm for the group Steiner problem
- 1 January 2006
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (1), 15-34
- https://doi.org/10.1016/j.dam.2005.07.010
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner ProblemLecture Notes in Computer Science, 2002
- Approximation algorithms for the covering Steiner problemRandom Structures & Algorithms, 2002
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- Approximating the weight of shallow Steiner treesDiscrete Applied Mathematics, 1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- A series of approximation algorithms for the acyclic directed steiner tree problemAlgorithmica, 1997
- Provably good routing tree construction with multi-port terminalsPublished by Association for Computing Machinery (ACM) ,1997
- Beyond Steiner's problem: A VLSI oriented generalizationLecture Notes in Computer Science, 1990
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989