Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal

@inproceedings{Kratsch2012CompressionVM,
  title={Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal},
  author={Stefan Kratsch and Magnus Wahlstr{\"o}m},
  booktitle={ACM Trans. Algorithms},
  year={2012}
}
The Odd Cycle Transversal problem (OCT) asks whether a given undirected graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result, Reed, Smith, and Vetta (Operations Research Letters, 2004) gave a O(4kkmn) time algorithm for it; this also implies that instances of the problem can be reduced to a so-called problem kernel of size O(4k). Since then, the existence of a polynomial kernel for OCT (i.e., a kernelization with size bounded polynomially in k) has turned… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 52 CITATIONS

Edge Bipartization Faster than $$2^k$$2k

VIEW 14 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND
HIGHLY INFLUENCED

2 0 Se p 20 15 Edge Bipartization faster than 2 k

Marcin Pilipczuk, Micha l Pilipczuk, Marcin Wrochna
  • 2015
VIEW 16 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

D S ] 8 J ul 2 01 5 Edge Bipartization faster than 2 k

Marcin Pilipczuk, Micha l Pilipczuk, Marcin Wrochna
  • 2015
VIEW 16 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Parameterized and Exact Computation

  • Lecture Notes in Computer Science
  • 2012
VIEW 8 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Representative Sets and Irrelevant Vertices: New Tools for Kernelization

  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
  • 2012
VIEW 8 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Approximation and Kernelization for Chordal Vertex Deletion

  • SIAM J. Discrete Math.
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2011
2018

CITATION STATISTICS

  • 7 Highly Influenced Citations

  • Averaged 7 Citations per year over the last 3 years

  • 53% Increase in citations per year in 2018 over 2017

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Vertex and edge bipartization with nonstandard parameters: Upper and lower bounds for kernelization

B. Jansen, S. Kratsch
  • 2011
VIEW 17 EXCERPTS
HIGHLY INFLUENTIAL

The multi-multiway cut problem

  • Theor. Comput. Sci.
  • 2007
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Infeasibility of instance compression and succinct PCPs for NP

  • J. Comput. Syst. Sci.
  • 2011
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

(Meta) Kernelization

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Finding odd cycle transversals

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…