eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-08-31
17:1
17:18
10.4230/LIPIcs.ESA.2021.17
article
Distant Representatives for Rectangles in the Plane
Biedl, Therese
1
https://orcid.org/0000-0002-9003-3783
Lubiw, Anna
1
Naredla, Anurag Murty
1
Ralbovsky, Peter Dominik
1
Stroud, Graeme
1
David R. Cheriton School of Computer Science, University of Waterloo, Canada
The input to the distant representatives problem is a set of n objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are axis-aligned rectangles, we give polynomial time constant-factor approximation algorithms for the L₁, L₂, and L_∞ distance measures. We also prove lower bounds on the approximation factors that can be achieved in polynomial time (unless P = NP).
https://drops.dagstuhl.de/storage/00lipics/lipics-vol204-esa2021/LIPIcs.ESA.2021.17/LIPIcs.ESA.2021.17.pdf
Distant representatives
blocker shapes
matching
approximation algorithm
APX-hardness