Packing and covering with segments

DOI10.1007/978-3-030-39881-1_17MaRDI QIDQ782181zbMATH OpenOpenAlexFDO

Authors Joseph S. B. Mitchell, Supantha Pandit

Publication date 22 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39881-1_17

zbMATH Keywords

dominating setNP-completesegmentsgeometric set coverinclined linepiercing set

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Covering, hitting, piercing and packing rectangles intersecting an inclined line
• On the hardness of some geometric optimization problems with rectangles
• Covering and packing of triangles intersecting a straight line
• Covering and packing of triangles intersecting a straight line
• Maximum independent and disjoint coverage

Cited in

(3)

• On Covering Segments with Unit Intervals
• On covering segments with unit intervals
• The longest segment in the complement of a packing

This page was built for publication: Packing and covering with segments

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