Minimum Membership Set Covering and the Consecutive Ones Property

DOI10.1007/11785293_32MaRDI QIDQ5757903zbMATH OpenOpenAlexFDO

Authors Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke

Publication date 7 September 2007

Published in Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Red-blue covering problems and the consecutive ones property
• Computing and Combinatorics
• Minimum membership covering and hitting
• Minimum membership covering and hitting
• Set covering with almost consecutive ones property

Cited in

(6)

• Red-blue covering problems and the consecutive ones property
• Set covering with almost consecutive ones property
• Minimum membership covering and hitting
• Parameterized complexity of minimum membership dominating set
• Maximum coverage in the data stream model: parameterized and generalized
• On the complexity of minimum membership dominating set

This page was built for publication: Minimum Membership Set Covering and the Consecutive Ones Property

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