TL;DR
This paper introduces a heuristic algorithm for treedepth decompositions that combines greedy elimination orderings with a Divide & Conquer strategy based on a reimplemented FlowCutter algorithm, aiming to improve decomposition efficiency.
Contribution
It presents a novel heuristic approach integrating greedy algorithms and balanced cut techniques for treedepth decomposition, submitted to the PACE 2020 challenge.
Findings
Effective heuristic for treedepth decomposition.
Utilizes a reimplemented FlowCutter for balanced cuts.
Achieved competitive results in PACE 2020 challenge.
Abstract
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the PACE 2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide & Conquer approach on balanced cuts obtained using a from-scratch reimplementation of the 2016 FlowCutter algorithm by Hamann & Strasser [ACM JEA 2018].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
