Packing cycles in undirected graphs

@article{Caprara2003PackingCI,
  title={Packing cycles in undirected graphs},
  author={A. Caprara and A. Panconesi and R. Rizzi},
  journal={J. Algorithms},
  year={2003},
  volume={48},
  pages={239-256}
}
Given an undirected graph G with n nodes and m edges, we address the problem of finding a largest collection of edge-disjoint cycles in G. The problem, dubbed CYCLE PACKING, is very closely related to a few genome rearrangement problems in computational biology. In this paper, we study the complexity and approximability of CYCLE PACKING, about which very little is known although the problem is natural and has practical applications. We show that the problem is APX- hard but can be approximated… Expand
Approximability of Packing Disjoint Cycles
TLDR
It is quasi-NP-hard to approximate the edge-disjoint cycle problem within ratio of O(log1/2-Ɛ n) for any constant Ɛ > 0 and the same results hold for the problem of packing vertex- Disjoint cycles. Expand
Approximation algorithms and hardness results for cycle packing problems
TLDR
A lower bound of Ω(log n/loglog n) is proved for the integrality gap of edge-disjoint cycle packing and the approximability of νe(G) in directed graphs, improving upon the previously known APX-hardness result for this problem. Expand
Approximability of Packing Disjoint Cycles
TLDR
It is shown that the undirected edge-disjoint cycle packing problem is quasi-NP-hard to approximate within ratio of $O(\log^{\frac{1}{2}-\epsilon}n)$ for any constant ε>0. Expand
Disjoint Cycles: Integrality Gap, Hardness, and Approximation
TLDR
It is shown that both problems of packing edge- Disjoint and packing vertex-disjoint cycles in a directed graph have an integrality gap of $\Omega(\frac{log n}{log log n})$, the first super constant lower bound for the integralities gap of these problems. Expand
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
TLDR
A simple combinatorial approximation algorithm for finding a shortest (simple) cycle in an undirected graph and returns with high probability a cycle of length 2k for even k and 2k + 2 for odd k, in time O(n3/2 √log n). Expand
Efficient approximation algorithms for shortest cycles in undirected graphs
TLDR
A simple combinatorial 2-approximation algorithm for finding a shortest (simple) cycle in an undirected graph that runs in time O(n^2logn(logn+logM)). Expand
Maximum cycle packing using SPR-trees
TLDR
It is proved that for generalized series-parallel multigraphs the algorithm is optimal, i.e. it determines a maximum cycle packing Z  *  in linear time. Expand
Packing cycles through prescribed vertices under modularity constraints
TLDR
It is proved that either a graph G has k disjoint S-cycles, each of which has length divisible by p, or G has a vertex set X of order at most f(k,p) such that [email protected]?X has no such a cycle. Expand
A Dynamic Programming Approach for the Max-Min Cycle Packing Problem in Even Graphs
Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles Ciin G such that s is maximum. In general, the maximum cycle packing problem isExpand
On packing shortest cycles in graphs
TLDR
It is shown that both problems to find a maximum packing of shortest edge-disjoint cycles in a graph of given girth g allow polynomial time algorithms for instances with maximum degree 3, but are APX-hard for instanceswith maximum degree 4. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
Conservative weightings and ear-decompositions of graphs
  • A. Frank
  • Mathematics, Computer Science
  • Comb.
  • 1993
TLDR
It is proved that the length of such a decomposition is always φ and it is shown how an optimal join can be constructed as the union of perfect matchings in the building blocks, using the Gallai-Edmonds structure theorem. Expand
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
  • A. Caprara
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • 1999
TLDR
A transformation from MAX-ACD to MIN-SBR is described, which is therefore shown to be NP-hard as well, answering an outstanding question which has been open for some years. Expand
On the maximal number of disjoint circuits of a graph
Throughout this paper Gg" will denote a graph with n vertices and k edges where circuits consisting of two edges and loops (i . e. circuits of one edge) are not permitted and G'" will denote a graphExpand
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
TLDR
The greedy algorithm is the first to come within a constant factor of the optimum; it guarantees a solution that uses no more than twice the minimum number of reversals, and the lower and upper bounds of the branch- and-bound algorithm are a novel application of maximum-weight matchings, shortest paths, and linear programming. Expand
Planar Formulae and Their Uses
TLDR
Using these results, it is able to provide simple and nearly uniform proofs of NP-completeness for planar node cover, planar Hamiltonian circuit and line, geometric connected dominating set, and of polynomial space completeness forPlanar generalized geography. Expand
The NP-Completeness of Some Edge-Partition Problems
  • I. Holyer
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1981
We show that for each fixed $n \geqq 3$ it is NP-complete to determine whether an arbitrary graph can be edge-partitioned into subgraphs isomorphic to the complete graph $K_n $. The NP-completenessExpand
On Some Tighter Inapproximability Results
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurrence satisfiability problems like MAX-2SAT and E2-LIN-2, andExpand
On Some Tighter Inapproximability Results (Extended Abstract)
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems like MAX-2SAT and E2-LIN-2, andExpand
Genome Rearrangements and Sorting by Reversals
TLDR
The reversal distance between two random permutations is shown to be very close to the reversal diameter, thereby indicating that reversal distance provides a good separation between related and nonrelated sequences in molecular evolution studies. Expand
Genome rearrangements and sorting by reversals
  • V. Bafna, P. Pevzner
  • Mathematics, Computer Science
  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
TLDR
It is demonstrated that the expected reversal distance is very close to the reversal diameter thereby indicating that reversal distance provides a good separation between related and non-related sequences. Expand
...
1
2
...