A Tighter Analysis of Set Cover Greedy Algorithm for Test Set

DOI10.1007/978-3-540-74450-4_3zbMath1176.68241OpenAlexW1752647939MaRDI QIDQ3611893

Peng Cui

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_3

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (3)

Deterministic versus randomized adaptive test cover ⋮ Randomized Adaptive Test Cover ⋮ Combinatorial search in two and more rounds

This page was built for publication: A Tighter Analysis of Set Cover Greedy Algorithm for Test Set