Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900942
DOI10.1007/b11961zbMath1279.68105OpenAlexW4298253479MaRDI QIDQ5900942
Shirley Halevy, Eyal Kushilevitz
Publication date: 26 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11961
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (7)
Testing graphs against an unknown distribution ⋮ Information theory in property testing and monotonicity testing in higher dimension ⋮ Distribution-free connectivity testing for sparse graphs ⋮ Property-preserving data reconstruction ⋮ Testing convexity properties of tree colorings ⋮ Fast approximate PCPs for multidimensional bin-packing problems ⋮ Tolerant property testing and distance approximation
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
