The Power of Linear Programming for Valued CSPs

@article{Thapper2012ThePO,
  title={The Power of Linear Programming for Valued CSPs},
  author={Johan Thapper and Stanislav Zivny},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={669-678}
}
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. This framework includes and generalises well-studied constraint satisfaction… CONTINUE READING

Topics

Statistics

051015201620172018
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.