103 search results - page 5 / 21 » Approximating rooted Steiner networks |
ESA
2008
Springer
14 years 3 days 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 ...
COCOA
2008
Springer
14 years 4 days ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
ADHOCNOW
2005
Springer
14 years 3 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...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE