Sciweavers

447 search results - page 7 / 90
» Approximation Algorithms for Directed Steiner Problems
Sort
View
COCOA
2008
Springer
13 years 10 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
14 years 15 days ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
WG
2001
Springer
14 years 25 days ago
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
DAM
2006
75views more  DAM 2006»
13 years 8 months ago
A greedy approximation algorithm for the group Steiner problem
Chandra Chekuri, Guy Even, Guy Kortsarz