3 papers
cs.DS2023
Faster Submodular Maximization for Several Classes of Matroids
Monika Henzinger, Paul Liu, Jan Vondrak +1
The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often w…
cs.CG2023
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Loïc Crombez, Guilherme D. da Fonseca, Florian Fontan +8
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 to…
cs.CG2021
Coordinated Motion Planning Through Randomized k-Opt
Paul Liu, Jack Spalding-Jamieson, Brandon Zhang +1
This paper examines the approach taken by team gitastrophe in the CG:SHOP 2021 challenge. The challenge was to find a sequence of simultaneous moves of square robots between two gi…