scientific article; zbMATH DE number 6783492
From MaRDI portal
Publication:5365139
zbMath1377.90077MaRDI QIDQ5365139
Rajsekar Manokaran, Madhur Tulsiani, Amit Kumar, Nisheeth K. Vishnoi
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133157
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items
Approximating CSPs Using LP Relaxation ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Minimizing the sum of weighted completion times in a concurrent open shop ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ PTAS for Sparse General-valued CSPs ⋮ Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs ⋮ Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
This page was built for publication: