Decomposition of multiple coverings into many parts

DOI10.1016/j.comgeo.2008.08.002zbMath1156.05013OpenAlexW2220719914MaRDI QIDQ955226

Géza Tóth, János Pach

Publication date: 19 November 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/129409/files/kanegyzet120406.pdf

zbMATH Keywords

coloringmultiple covering

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items (10)

Convex polygons are cover-decomposable ⋮ Unsplittable coverings in the plane ⋮ Decomposition of multiple coverings into more parts ⋮ Set it and forget it: approximating the set once strip cover problem ⋮ Coloring points with respect to squares ⋮ Changing of the guards: strip cover with duty cycling ⋮ Optimally decomposing coverings with translates of a convex polygon ⋮ Polychromatic coloring for half-planes ⋮ Octants are cover-decomposable into many coverings ⋮ Conflict-free coloring of string graphs

Cites Work

• Covering the plane with convex polygons
• Multiple coverings of the plane with triangles
• Approximating theDomatic Number
• Coloring Geometric Range Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of multiple coverings into many parts