202 search results - page 1 / 41 » Cycle Cover with Short Cycles |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
SIAMDM
2010
13 years 3 months ago
2010
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
DM
2007
13 years 5 months ago
2007
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...