Engineering Kernelization for Maximum Cut

DOI10.1137/1.9781611976007.3MaRDI QIDQ5147491zbMATH OpenOpenAlexFDO

Authors Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.10902

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Reflections on kernelizing and computing unrooted agreement forests
• scientific article; zbMATH DE number 7651198 (Why is no real title available?)
• Faster exact solution of sparse maxcut and QUBO problems
• On the descriptive complexity of vertex deletion problems
• A preprocessing technique for quadratic unconstrained binary optimization

This page was built for publication: Engineering Kernelization for Maximum Cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147491)