Searching for "An approximation algorithm for the group Steiner problem." – sorted by Relevance.
-
A Combinatorial Approximation Algorithm for the Group Steiner Problem
- A combinatorial approximation algorithm for the group Steiner problem Chandra Chekuri Guy Even
- Cited by 10 (1 self) – Add To MetaCart
-
Improved Approximation Bounds for the Group Steiner Problem
- Steiner nodes). The first published approximation algorithm for the Group Steiner Problem produced
- Cited by 5 (1 self) – Add To MetaCart
-
Cv
- polylogarithmic approximation algorithm for the group Steiner problem, with N. Garg and R. Ravi, Proc. of the 9th
- Add To MetaCart
-
unknown title
- A greedy approximation algorithm for the group Steiner problem Chandra Chekuri \Lambda Guy
- Add To MetaCart
-
Multi-Embedding and Path Approximation of Metric Spaces
- Steiner problem with k groups dened on N . Then there is a randomized 2r()-approximation algorithm
- Add To MetaCart
-
A New Approximation Scheme for the Group Steiner Problem \Lambda
- A New Approximation Scheme for the Group Steiner Problem \Lambda C. S. Helvig Gabriel Robins
- Add To MetaCart
-
Provably Good Routing Tree Construction with Multi-Port Terminals
- gives rise to the group Steiner minimal tree problem. In this paper, we address the general problem
- Cited by 18 (0 self) – Add To MetaCart

