Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
نویسندگان
چکیده
منابع مشابه
On Approximating Restricted Cycle Covers
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 L. A special case of L-cycle covers are k-cycle covers for k ∈ N, where the length of each cycle must be at least k. The weight of a cycle cover of an edge-weighted graph is the sum of the weights of its edges. We com...
متن کاملDirected cycle double covers: structure and generation of hexagon graphs
Jaeger’s directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show that hexagon graphs are braces that can be generated from the ladder on 8 vertices using two types of McCuaig’s augmentations.
متن کاملMaximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs
Centralised matching programs have been established in several countries to organise kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually the goal is to maximise the number of transpla...
متن کاملApproximating maximum weight K-colorable subgraphs in chordal graphs
We present a 2-approximation algorithm for the problem of finding the maximum weight K-colorable subgraph in a given chordal graph with node weights. The running time of the algorithm is O(K(n+m)), where n and m are the number of vertices and edges in the given graph.
متن کاملDirected cycle double covers and cut-obstacles
A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstructions to the existence of a directed cycle double cover in a graph are bridges. Jaeger [4] conjectured that bridges are actually the only obstructions. One of the difficulties in proving the Jaeg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2005
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-004-1131-0