License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2022.72
URN: urn:nbn:de:0030-drops-160807
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16080/
Spalding-Jamieson, Jack ;
Zhang, Brandon ;
Zheng, Da Wei
Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)
Abstract
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.
BibTeX - Entry
@InProceedings{spaldingjamieson_et_al:LIPIcs.SoCG.2022.72,
author = {Spalding-Jamieson, Jack and Zhang, Brandon and Zheng, Da Wei},
title = {{Conflict-Based Local Search for Minimum Partition into Plane Subgraphs}},
booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)},
pages = {72:1--72:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-227-3},
ISSN = {1868-8969},
year = {2022},
volume = {224},
editor = {Goaoc, Xavier and Kerber, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16080},
URN = {urn:nbn:de:0030-drops-160807},
doi = {10.4230/LIPIcs.SoCG.2022.72},
annote = {Keywords: local search, planar graph, graph colouring, geometric graph, conflict optimizer}
}
