Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring - Archive ouverte HAL Access content directly
Journal Articles ACM Journal of Experimental Algorithmics Year : 2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

Abstract

CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the top three teams used the same technique, called conflict optimization. This technique has been introduced in the 2021 edition of the challenge, to solve a coordinated motion planning problem. In this paper, we present the technique in the more general framework of binary constraint satisfaction problems (binary CSP). Then, the top three teams describe their different implementations of the same underlying strategy. We evaluate the performance of those implementations to vertex color not only geometric graphs, but also other types of graphs.
Fichier principal
Vignette du fichier
JEA_CGSHOP22.pdf (732.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04051492 , version 1 (30-03-2023)

Identifiers

Cite

Loïc Crombez, Guilherme da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, et al.. Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM Journal of Experimental Algorithmics, 2023, ⟨10.1145/3588869⟩. ⟨hal-04051492⟩
106 View
37 Download

Altmetric

Share

Gmail Facebook X LinkedIn More