654 search results - page 51 / 131 » An efficient approximation algorithm for the survivable netw... |
SIAMDM
2010
13 years 3 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
CC
2006
Springer
14 years 20 days ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
STOC
2007
ACM
14 years 9 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...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...