Distant Representatives for Rectangles in the Plane

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-fac...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-08
Hauptverfasser:	Biedl, Therese, Lubiw, Anna, Anurag Murty Naredla, Ralbovsky, Peter Dominik, Stroud, Graeme
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Lower bounds Mathematical analysis Polynomials Rectangles Time constant
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!