Kumar, Amit; Manokaran, Rajsekar; Tulsiani, Madhur; Vishnoi, Nisheeth K. On LP-based approximability for strict CSPs. (English) Zbl 1377.90077 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1560-1573 (2011). Cited in 7 Documents MSC: 90C27 Combinatorial optimization 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 68W25 Approximation algorithms 90C05 Linear programming Citations:Zbl 1231.68142 PDFBibTeX XMLCite \textit{A. Kumar} et al., in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1560--1573 (2011; Zbl 1377.90077) Full Text: Link