58 citations · 239 across the 47 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DM2021
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises
Cornelius Brand, Martin Koutecký, Alexandra Lassota +1
An influential 1990 paper of Hochbaum and Shanthikumar made it common wisdom that "convex separable optimization is not much harder than linear optimization" [JACM 1990]. We exhibi…
cs.AI2021
Solving Infinite-Domain CSPs Using the Patchwork Property
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak +1
The constraint satisfaction problem (CSP) has important applications in computer science and AI. In particular, infinite-domain CSPs have been intensively used in subareas of AI su…