Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.68611OpenAlexW2649657569MaRDI QIDQ5479362

Luca Trevisan, Venkatesan Guruswami

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

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (5)

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares ⋮ A 4.31-approximation for the geometric unique coverage problem on unit disks ⋮ The Budgeted Unique Coverage Problem and Color-Coding ⋮ Imperfect gaps in Gap-ETH and PCPs ⋮ Nearly Optimal NP-Hardness of Unique Coverage

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