Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.68365OpenAlexW2649657569MaRDI QIDQ5479381

Shirley Halevy, Eyal Kushilevitz

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538462

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (1)

Parameterized property testing of functions

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques