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

Author:

Crombez Loïc1ORCID,Da Fonseca Guilherme D.2ORCID,Fontan Florian3ORCID,Gerard Yan1ORCID,Gonzalez-Lorenzo Aldo2ORCID,Lafourcade Pascal1ORCID,Libralesso Luc1ORCID,Momège Benjamin4ORCID,Spalding-Jamieson Jack5ORCID,Zhang Brandon6ORCID,Zheng Da Wei7ORCID

Affiliation:

1. LIMOS, Université Clermont Auvergne, Clermont-Fd, France

2. LIS, Aix-Marseille Université, France

3. Independent Researcher, Paris, France

4. Independent Researcher, Clermont-Ferrand, France

5. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

6. Independent Researcher, Vancouver, Canada

7. Department of Computer Science, University of Illinois at Urbana-Champaign, IL, USA

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 article, 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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3