> Details

Spalding-Jamieson, Jack [Author]; Zhang, Brandon [Author]; Zheng, Da Wei [Author] ; Jack Spalding-Jamieson and Brandon Zhang and Da Wei Zheng [Contributor]

Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)
  • Contributor: Spalding-Jamieson, Jack [Author]; Zhang, Brandon [Author]; Zheng, Da Wei [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.SoCG.2022.72
  • Keywords: graph colouring ; local search ; conflict optimizer ; geometric graph ; planar graph
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access