Data structures and network algorithms
Data structures and network algorithms
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Graph minors. VII. Disjoint paths on a surface
Journal of Combinatorial Theory Series B
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Graph minors. IX. Disjoint crossed paths
Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Graph minors. XI.: circuits on a surface
Journal of Combinatorial Theory Series B
Quickly excluding a planar graph
Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Graph minors. XII: distance on a surface
Journal of Combinatorial Theory Series B
Handbook of combinatorics (vol. 1)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Highly connected sets and the excluded grid theorem
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
The extremal function for complete minors
Journal of Combinatorial Theory Series B
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Packing Digraphs with Directed Closed Trails
Combinatorics, Probability and Computing
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
Journal of Combinatorial Theory Series B
Packing Non-Zero A-Paths In Group-Labelled Graphs
Combinatorica
Approximate min–max relations for odd cycles in planar graphs
Mathematical Programming: Series A and B
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms (TALG)
Non-zero disjoint cycles in highly connected group labelled graphs
Journal of Combinatorial Theory Series B
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Some remarks on the odd hadwiger’s conjecture
Combinatorica
On the odd-minor variant of Hadwiger's conjecture
Journal of Combinatorial Theory Series B
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph minors. XXI. Graphs with unique linkages
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Note: Note on coloring graphs without odd-Kk-minors
Journal of Combinatorial Theory Series B
Combinatorica
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Graph Minors. XXII. Irrelevant vertices in linkage problems
Journal of Combinatorial Theory Series B
Finding odd cycle transversals
Operations Research Letters
Tight bounds for linkages in planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear kernels for (connected) dominating set on H-minor-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Induced packing of odd cycles in planar graphs
Theoretical Computer Science
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Parameterized tractability of multiway cut with parity constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
We consider the following problem, which is called the odd cycle packing problem. Input: A graph $G$ with n vertices and m edges, and an integer k. Output: k vertex disjoint odd cycles. We also consider the edge disjoint case, and the node- and arc-disjoint directed case. This problem is known to be NP-hard, even for planar graphs, if k is part of input. In this paper, we first present the integrality gap and hardness results for these problems. We prove that the integrality gap of the standard LP-relaxation of the odd cycle packing problem is Θ (√n). This result is obtained by giving an algorithm to compute an odd cycle packing, which gives rise to an O(√n) approximating algorithm for the fractional odd cycle packing problem (this gives rise to an upper bound), and by showing that there is a graph G such that there is an O(√n) half-integral odd cycle packing in G, but there are no two disjoint odd cycle in G (this gives rise to a lower bound). For the hardness result, we prove that for any ε, the node-disjoint directed odd cycle packing problem is NP-hard to approximate within m1/2-ε, where m is the number of arcs of a given digraph G. This is true not only for the node-disjoint directed odd cycle packing problem but also for the arc-disjoint directed odd cycle packing problem. In addition, we prove that there is an O(m1/2)-approximation algorithm for the node- and arc- directed odd cycle packing problems. Thus this approximation algorithm almost matches the hardness result. For the positive side, we consider the case when the number of odd cycles, k, is fixed. This is a natural direction, for example, the seminal result of Robertson and Seymour for the disjoint paths problem in the graph minors project. We present an O(m α(m,n) n) algorithm for any fixed k, where the function α(m,n) is the inverse of the Ackermann function (see by Tarjan [72]). This is the first polynomial time algorithm for this problem (and in fact, it is the first fixed parameter tractable algorithm). This proves a conjecture by Lovasz and Schrijver in early 1980's, who gave a polynomial time algorithm for the case k=2. Our algorithm can be applied to decide whether or not G has k edge disjoint odd cycle with the same time complexity for any fixed k. We also show that our algorithm gives rise to the Graph Minor Algorithm for the k vertex-disjoint paths problem by Robertson and Seymour for any fixed k. Thus our algorithm is beyond the framework of the Graph Minor Theory. Our algorithm has several appealing features: We use the odd S-path theorem, which is a generalization of the well-known S-paths theorem by Mader. We also introduce an odd clique minor, which can be viewed as a clique minor with some parity condition. As with the Robertson-Seymour algorithm to solve the k disjoint paths problem for any fixed k, in each iteration, we would like to either use a huge clique minor as a "crossbar", or exploit the structure of graphs in which we cannot find such a minor. Here, however, we must maintain the parity of the cycles and can only use an "odd clique minor". We must also describe the structure of those graphs in which we cannot find such a minor and discuss how to exploit it. This part needs the seminal result of Robertson and Seymour for the graph minor decomposition theorem for H-minor-free graphs. We also use some deep results of Robertson and Seymour that are needed to prove the correctness of their algorithm for the disjoint paths problem.