Sciweavers

291 search results - page 2 / 59
» Factor 2 Approximation Algorithm for the Generalized Steiner...
Sort
View
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 6 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
NETWORKS
2006
13 years 6 months ago
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
Stefan Hougardy, Stefan Kirchner
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 8 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
COR
2007
108views more  COR 2007»
13 years 6 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
13 years 10 months ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani