A special case of set covering problems

DOI10.1007/BF00429752zbMath0844.90068OpenAlexW2016643839MaRDI QIDQ1908929

M. Reza Emamy-K., A. I. Ramírez

Publication date: 5 May 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00429752

zbMATH Keywords

polynomial algorithmset covering problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Polynomial-time algorithms for regular set-covering and threshold synthesis
• Subcube fault-tolerance in hypercubes
• SOME RESULTS ON BUDS, STEMS AND FAULT TOLERANCE IN HYPERCUBES OF DIMENSION ⋚ 5
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A special case of set covering problems