An algorithm for the difference between set covers

DOI10.1016/J.DAM.2007.10.031zbMath1152.05316OpenAlexW1999969464MaRDI QIDQ944712

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

facehypercuberectilinear polygondistributive latticerectangledifferenceset coverpseudocomplement

Mathematics Subject Classification ID

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

Cites Work

• Can visibility graphs be represented compactly?
• Dynamic subgraph connectivity with geometric applications
• An algorithm for covering polygons with rectangles
• Unnamed Item
• Unnamed Item
• Unnamed Item

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