16 search results - page 2 / 4 » Approximability of the k-server disconnection problem |
TAMC
2009
Springer
14 years 5 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
STOC
1998
ACM
13 years 10 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
JNS
2010
13 years 13 days ago
2010
Under certain conditions the problem of morphogenesis in development and the problem of morphology in block copolymers may be reduced to one geometric problem. In two dimensions t...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...