Deep approximation of set cover greedy algorithm for test set

MaRDI QIDQ5490393zbMATH OpenFDO

Authors Peng Cui, Hongjing Liu

Publication date 4 October 2006

zbMATH Keywords

derandomization methodredundant test setset cover greedy algorithmtest set

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Approximation algorithms for the test cover problem
• scientific article; zbMATH DE number 1875415
• scientific article; zbMATH DE number 1256748

Cited in

(3)

• A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
• scientific article; zbMATH DE number 1875415 (Why is no real title available?)
• Algorithm Theory - SWAT 2004

This page was built for publication: Deep approximation of set cover greedy algorithm for test set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490393)