291 search results - page 7 / 59 » Factor 2 Approximation Algorithm for the Generalized Steiner... |
CATS
2007
13 years 8 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
IPCO
2010
13 years 8 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
INFOCOM
2010
IEEE
13 years 4 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...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...