Sciweavers

666 search results - page 12 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
WG
2001
Springer
14 years 2 months ago
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
JISE
2006
107views more  JISE 2006»
13 years 10 months ago
FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem
Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 11 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
14 years 3 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta