Sciweavers

22 search results - page 1 / 5
» FasterDSP: A Faster Approximation Algorithm for Directed Ste...
Sort
View
JISE
2006
107views more  JISE 2006»
13 years 3 months ago
FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem
Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
13 years 7 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
13 years 8 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 4 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
13 years 8 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky