Sciweavers

27 search results - page 1 / 6
» An Improved LP-based Approximation for Steiner Tree
Sort
View
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 4 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...
DAC
2001
ACM
14 years 5 months ago
Creating and Exploiting Flexibility in Steiner Trees
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
Elaheh Bozorgzadeh, Ryan Kastner, Majid Sarrafzade...
COCOON
2005
Springer
13 years 10 months ago
Algorithms for Terminal Steiner Trees
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
Fábio Viduani Martinez, José Coelho ...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
13 years 9 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...
ICALP
2009
Springer
14 years 4 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...