scientific article
From MaRDI portal
Publication:2913811
DOI10.4086/toc.2012.v008a011zbMath1255.68303OpenAlexW2611404581MaRDI QIDQ2913811
Yuan Zhou, Venkatesan Guruswami
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (5)
Complexity of approximating CSP with balance/hard constraints ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs ⋮ Nearly Optimal NP-Hardness of Unique Coverage
Cites Work
This page was built for publication:
