509 search results - page 14 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
INFOCOM
2009
IEEE
14 years 2 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...
INFOCOM
2010
IEEE
13 years 5 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...