2026-07-23T05:17:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16080 2024-03-06T10:56:54Z ddc:004 open_access

Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge) Spalding-Jamieson, Jack Zhang, Brandon Zheng, Da Wei local search planar graph graph colouring geometric graph conflict optimizer This paper examines the approach taken by team gitastrophe in the CG:SHOP 2022 challenge. The challenge was to partition the edges of a geometric graph, with vertices represented by points in the plane and edges as straight lines, into the minimum number of planar subgraphs. We used a simple variation of a conflict optimizer strategy used by team Shadoks in the previous year’s CG:SHOP to rank second in the challenge. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jack Spalding-Jamieson and Brandon Zhang and Da Wei Zheng 2022 Is Part Of LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2022.72 urn:nbn:de:0030-drops-160807 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.72 eng https://creativecommons.org/licenses/by/4.0/legalcode