Engineering Kernelization for Maximum Cut

DOI10.1137/1.9781611976007.3OpenAlexW3003195043MaRDI QIDQ5147491FDOQ5147491

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 (3)

• Title not available (Why is that?)
• Faster exact solution of sparse maxcut and QUBO problems
• Reflections on kernelizing and computing unrooted agreement forests

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)