• Corpus ID: 7249609

Packing Cycles Faster Than Erd\H{o}s-P\'osa

@article{Lokshtanov2017PackingCF,
  title={Packing Cycles Faster Than Erd\H\{o\}s-P\'osa},
  author={Daniel Lokshtanov and Amer E. Mouawad and Saket Saurabh and Meirav Zehavi},
  journal={arXiv: Data Structures and Algorithms},
  year={2017}
}
The Cycle Packing problem asks whether a given undirected graph $G=(V,E)$ contains $k$ vertex-disjoint cycles. Since the publication of the classic Erd\H{o}s-P\'osa theorem in 1965, this problem received significant scientific attention in the fields of Graph Theory and Algorithm Design. In particular, this problem is one of the first problems studied in the framework of Parameterized Complexity. The non-uniform fixed-parameter tractability of Cycle Packing follows from the Robertson-Seymour… 

Figures from this paper

References

SHOWING 1-10 OF 41 REFERENCES

Approximability of Packing Disjoint Cycles

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.

Approximation algorithms and hardness results for cycle packing problems

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.

Half-integral packing of odd cycles through prescribed vertices

This paper discusses packing disjoint S-cycles, i.e., cycles that are required to go through a set S of vertices, and shows the Erdős-Pósa-type result for the half-integral packing of odd S- cycles, which is a generalization of Reed (1999) when S=V.

Improved Bounds for the Excluded Grid Theorem

A number of new techniques are introduced, including a conceptually simple and almost entirely self-contained proof of the theorem that achieves a polynomial bound on $f(g)$.

Large-treewidth graph decompositions and applications

Two theorems on the tradeoff between the number of the desired subgraphs h, and the desired lower bound r on the treewidth of each subgraph are proved, which leads to substantially improved parameters in some Erdos-Posa-type results, and faster algorithms for some fixed-parameter tractable problems.

Excluded Grid Theorem: Improved and Simplified

This paper provides a much simpler proof of the Excluded Grid Theorem, achieving a bound of f(g)=O(g^{36} poly log g) and uses prior work to reduce the maximum vertex degree of the input graph to a constant.

Polynomial bounds for the grid-minor theorem

The first polynomial relationship between treewidth and grid-minor size is obtained by showing that f(k) = Ω(kδ) for some fixed constant δ > 0, and an algorithm is described that finds a model of such a grid-Minor in G.

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.