The power of linear programming for valued CSPs

DOI10.1109/FOCS.2012.25MaRDI QIDQ6988177zbMATH OpenFDO

Authors Stanislav Ivný, Johan Thapper

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.25

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(3)

• Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
• The Sherali-Adams and Weisfeiler-Leman hierarchies in (promise valued) constraint satisfaction problems
• An exponential value-oracle lower bound for k-submodular function minimization

This page was built for publication: The power of linear programming for valued CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988177)