447 search results - page 13 / 90 » Approximation Algorithms for Directed Steiner Problems |
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
JCO
2008
14 years 11 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
116
click to vote
CORR
2007
Springer
14 years 11 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 ...
117
click to vote
INFOCOM
2010
IEEE
14 years 9 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...