An Efficient Algorithm for Finding an Irredundant Set Cover

DOI10.1145/321832.321833MaRDI QIDQ4047389zbMATH OpenOpenAlexFDO

Authors Ramachendra P. Batni, Jeffrey D. Russell, C. R. Kime

Publication date 1974

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321832.321833

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Integer programming (90C10)

Cited in

(3)

• An algorithm for set covering problem
• Irredundant Set Faster Than O(2 n )
• Towards Concise Representation for Taxonomies of Epistemic Communities

This page was built for publication: An Efficient Algorithm for Finding an Irredundant Set Cover

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