A Class of Polynomially Solvable Set-Covering Problems

DOI10.1137/0401031zbMath0678.05048OpenAlexW2077333323MaRDI QIDQ3834089

Paola Bertolazzi, Antonio Sassano

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401031

zbMATH Keywords

matroidclutterset-covering problemmatroidal clutters

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function ⋮ An O(m n) algorithm for regular set-covering problems ⋮ Boolean minors ⋮ A decomposition strategy for the vertex cover problem ⋮ A neural network for the minimum set covering problem ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: A Class of Polynomially Solvable Set-Covering Problems