Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313032
DOI10.1007/b99805zbMath1105.68346arXivcs/0408066OpenAlexW4301133941MaRDI QIDQ5313032
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0408066
Related Items (3)
Tensor Products of Weakly Smooth Codes Are Robust ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Short Locally Testable Codes and Proofs
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques