16 search results - page 1 / 4 » Approximability of the k-server disconnection problem |
NETWORKS
2007
13 years 10 months ago
2007
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
CBSE
2004
Springer
14 years 4 months ago
2004
Springer
: In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall ...
WAOA
2005
Springer
14 years 4 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
ESA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...