562 search results - page 6 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
JCO
2008
13 years 7 months ago
2008
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
ASIAN
1999
Springer
13 years 11 months ago
1999
Springer
STOC
1998
ACM
13 years 11 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...