SAT-based local search for plane subgraph partitions (CG challenge)

DOI10.4230/LIPICS.SOCG.2022.74MaRDI QIDQ6539586zbMATH OpenFDO

Authors André Schidler

Publication date 14 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2022.74

zbMATH Keywords

graph coloringlarge neighborhood searchlocal improvementlogicplane subgraphsSATSLIM

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shadoks approach to minimum partition into plane subgraphs (CG challenge)
• Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
• Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
• Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
• Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)

Cited in

(5)

• Shadoks approach to minimum partition into plane subgraphs (CG challenge)
• Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
• Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
• Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
• Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

This page was built for publication: SAT-based local search for plane subgraph partitions (CG challenge)

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