An algorithm for the difference between set covers

DOI10.1016/J.DAM.2007.10.031MaRDI QIDQ944712zbMATH OpenOpenAlexFDO

Authors D. S. Franzblau, G. Xenakis

Publication date 10 September 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.10.031

zbMATH Keywords

differencedistributive latticefacehypercubepseudocomplementrectanglerectilinear polygonset cover

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Distributive lattices (06D99) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Discrete mathematics in relation to computer science (68R99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The complexity of minimum difference cover
• On the differential approximation of MIN SET COVER
• An O(m n) algorithm for regular set-covering problems
• A special case of set covering problems
• On the facial structure of the set covering polytope

Cites work

• An algorithm for covering polygons with rectangles
• Can visibility graphs be represented compactly?
• Dynamic subgraph connectivity with geometric applications
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• An algorithm for set covering problem
• An algorithm for enumerating difference sets

This page was built for publication: An algorithm for the difference between set covers

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