Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313015
DOI10.1007/b99805zbMath1105.68047MaRDI QIDQ5313015
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99805
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem, Unnamed Item, A note on unique games, Approximating maximum satisfiable subsystems of linear equations of bounded width, On the hardness of approximating max-satisfy