632 search results - page 6 / 127 » On the Approximability of the Steiner Tree Problem |
JISE
2006
13 years 7 months ago
2006
DAM
1998
13 years 7 months ago
1998
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
IPCO
2001
13 years 9 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
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...