On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property

DOI10.1007/978-3-642-32241-9_15zbMath1364.68353OpenAlexW41767041MaRDI QIDQ2914322

Chih-Hsuan Li, Biing-Feng Wang

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_15

zbMATH Keywords

algorithmsset cover2-satisfiabilityminimum degree hypergraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Hypergraphs (05C65) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property