The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization

@inproceedings{Kolmogorov2013ThePO,
  title={The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization},
  author={Vladimir Kolmogorov},
  booktitle={ICALP},
  year={2013}
}
A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 15 CITATIONS

Half-integrality, LP-branching, and FPT Algorithms

Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
  • SIAM J. Comput.
  • 2016
VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Higher Order Maximum Persistency and Comparison Theorems

  • Computer Vision and Image Understanding
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

O ct 2 01 5 Necessary Conditions for Tractability of Valued CSPs ∗

Johan Thapper
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

A New Look at Reweighted Message Passing

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

Necessary conditions for tractability of valued CSPs

  • SIAM J. Discrete Math.
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND