18 search results - page 1 / 4 » Approximability of Packing Disjoint Cycles |
ALGORITHMICA
2011
12 years 11 months ago
2011
ESA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
DM
2010
13 years 4 months ago
2010
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
MOR
2000
13 years 4 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...