Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313015
DOI10.1007/B99805zbMath1105.68047OpenAlexW4301133941MaRDI 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (5)
A note on unique games ⋮ Unnamed Item ⋮ Approximating maximum satisfiable subsystems of linear equations of bounded width ⋮ Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem ⋮ On the hardness of approximating max-satisfy
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
