Join Our Newsletter

16 search results - page 1 / 4» Approximating Maximum Weight Cycle Covers in Directed Graphs... |

ALGORITHMICA

2005

8 years 11 months ago
2005

A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...

WAOA

2005

Springer

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

CORR

2006

Springer

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

WG

2007

Springer

9 years 5 months ago
2007

Springer

APPROX

2004

Springer

9 years 4 months ago
2004

Springer

We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...