Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1106.68432OpenAlexW4301133941MaRDI QIDQ5313045

Piotr Berman, Bhaskar Das Gupta, Eduardo D. Sontag

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers ⋮ Approximating set multi-covers ⋮ Parameterized lower bound and inapproximability of polylogarithmic string barcoding ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ Molecular systems biology and control