Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
From MaRDI portal
Publication:3104640
DOI10.1007/978-3-642-25591-5_47zbMath1350.68158arXiv1109.3651OpenAlexW1887209283MaRDI QIDQ3104640
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3651
approximation algorithmoptimization problemconstraint satisfaction problemAPXapproximation-preserving reducibilityPO
Analysis of algorithms and problem complexity (68Q25) Large-scale problems in mathematical programming (90C06)
Related Items