Linear Kernels and Linear-Time Algorithms for Finding Large Cuts

Michael Etscheid, Matthias Mnich

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Original languageEnglish
Title of host publication27th International Symposium on Algorithms and Computation (ISAAC 2016)
PublisherSchloss Dagstuhl
DOIs
Publication statusPublished - 2016

Publication series

SeriesLeibniz International Proceedings in Informatics (LIPIcs)
Volume64

Keywords

  • Max-Cut
  • fixed-parameter tractability
  • kernelization

Cite this

Etscheid, M., & Mnich, M. (2016). Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. In 27th International Symposium on Algorithms and Computation (ISAAC 2016) Schloss Dagstuhl. Leibniz International Proceedings in Informatics (LIPIcs), Vol.. 64 https://doi.org/10.4230/LIPIcs.ISAAC.2016.31