Join Our Newsletter

47 search results - page 1 / 10» On Approximating Restricted Cycle Covers |

CORR

2006

Springer

8 years 10 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 ...

WAOA

2005

Springer

9 years 3 months ago
2005

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...

STACS

2005

Springer

9 years 3 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...

CORR

2006

Springer

8 years 10 months ago
2006

Springer

Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...

WG

2007

Springer

9 years 4 months ago
2007

Springer