License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2021.17
URN: urn:nbn:de:0030-drops-145982
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14598/
Go to the corresponding LIPIcs Volume Portal


Biedl, Therese ; Lubiw, Anna ; Naredla, Anurag Murty ; Ralbovsky, Peter Dominik ; Stroud, Graeme

Distant Representatives for Rectangles in the Plane

pdf-format:
LIPIcs-ESA-2021-17.pdf (2 MB)


Abstract

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

BibTeX - Entry

@InProceedings{biedl_et_al:LIPIcs.ESA.2021.17,
  author =	{Biedl, Therese and Lubiw, Anna and Naredla, Anurag Murty and Ralbovsky, Peter Dominik and Stroud, Graeme},
  title =	{{Distant Representatives for Rectangles in the Plane}},
  booktitle =	{29th Annual European Symposium on Algorithms (ESA 2021)},
  pages =	{17:1--17:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-204-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{204},
  editor =	{Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14598},
  URN =		{urn:nbn:de:0030-drops-145982},
  doi =		{10.4230/LIPIcs.ESA.2021.17},
  annote =	{Keywords: Distant representatives, blocker shapes, matching, approximation algorithm, APX-hardness}
}

Keywords: Distant representatives, blocker shapes, matching, approximation algorithm, APX-hardness
Collection: 29th Annual European Symposium on Algorithms (ESA 2021)
Issue Date: 2021
Date of publication: 31.08.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI