Minimum ply covering of points with unit squares

DOI10.1007/978-3-031-27051-2_3arXiv2208.06122MaRDI QIDQ6091141

J. Mark Keil, Stephane Durocher, Debajyoti Mondal

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.06122

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum ply covering of points with disks and squares
• Geometric optimization revisited
• The parameterized complexity of unique coverage and its variants
• Union-copy structures and dynamic segment trees
• Combination Can Be Hard: Approximability of the Unique Coverage Problem
• PTAS for Weighted Set Cover on Unit Squares
• Discrete unit square cover problem
• Computing and Combinatorics

This page was built for publication: Minimum ply covering of points with unit squares