How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?

Daniel Prusa, Tomás Werner. How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?. In Xue-Cheng Tai, Egil Bae, Tony F. Chan, Marius Lysaker, editors, Energy Minimization Methods in Computer Vision and Pattern Recognition - 10th International Conference, EMMCVPR 2015, Hong Kong, China, January 13-16, 2015. Proceedings. Volume 8932 of Lecture Notes in Computer Science, pages 57-70, Springer, 2014. [doi]

@inproceedings{PrusaW14,
  title = {How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?},
  author = {Daniel Prusa and Tomás Werner},
  year = {2014},
  doi = {10.1007/978-3-319-14612-6_5},
  url = {http://dx.doi.org/10.1007/978-3-319-14612-6_5},
  researchr = {https://researchr.org/publication/PrusaW14},
  cites = {0},
  citedby = {0},
  pages = {57-70},
  booktitle = {Energy Minimization Methods in Computer Vision and Pattern Recognition - 10th International Conference, EMMCVPR 2015, Hong Kong, China, January 13-16, 2015. Proceedings},
  editor = {Xue-Cheng Tai and Egil Bae and Tony F. Chan and Marius Lysaker},
  volume = {8932},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-14611-9},
}