Sciweavers

106 search results - page 6 / 22
» On the Approximability of the Steiner Tree Problem in Phylog...
Sort
View
JISE
2006
107views more  JISE 2006»
13 years 7 months ago
FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem
Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai
IPL
2002
105views more  IPL 2002»
13 years 7 months ago
Steiner trees in uniformly quasi-bipartite graphs
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
ADHOCNOW
2005
Springer
14 years 1 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 9 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 7 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