Proof of covering minimality by generalizing the notion of independence

DOI10.1134/S1990478917020053zbMath1399.90220OpenAlexW2620049474MaRDI QIDQ5373999

I. P. Chukhrov

Publication date: 6 April 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478917020053

zbMATH Keywords

complexitylower boundindependent setset covering problemminimal covercondition of minimalityshortest cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

On the Complexity of Minimizing Quasicyclic Boolean Functions

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient local search heuristic with row weighting for the unicost set covering problem
• What is the best greedy-like heuristic for the weighted set covering problem?
• On a minimization problem for a set of Boolean functions
• On complexity measures of complexes of faces in the unit cube
• Discrete optimization

This page was built for publication: Proof of covering minimality by generalizing the notion of independence