On LP-Based Approximability for Strict CSPs

Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi. On LP-Based Approximability for Strict CSPs. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1560-1573, SIAM, 2011. [doi]

@inproceedings{KumarMTV11,
  title = {On LP-Based Approximability for Strict CSPs},
  author = {Amit Kumar and Rajsekar Manokaran and Madhur Tulsiani and Nisheeth K. Vishnoi},
  year = {2011},
  url = {http://www.siam.org/proceedings/soda/2011/SODA11_120_kumara.pdf},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/KumarMTV11},
  cites = {0},
  citedby = {0},
  pages = {1560-1573},
  booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011},
  editor = {Dana Randall},
  publisher = {SIAM},
}