License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2017.40
URN: urn:nbn:de:0030-drops-78438
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7843/
Go to the corresponding LIPIcs Volume Portal


Gawrychowski, Pawel ; Krasnopolsky, Nadav ; Mozes, Shay ; Weimann, Oren

Dispersion on Trees

pdf-format:
LIPIcs-ESA-2017-40.pdf (0.5 MB)


Abstract

In the k-dispersion problem, we need to select k nodes of a given graph so as to maximize the minimum distance between any two chosen nodes. This can be seen as a generalization of the independent set problem, where the goal is to select nodes so that the minimum distance is larger than 1. We design an optimal O(n) time algorithm for the dispersion problem on trees consisting of n nodes, thus improving the previous O(n log n) time solution from 1997. We also consider the weighted case, where the goal is to choose a set of nodes of total weight at least W. We present an O(n log^2n) algorithm improving the previous O(n log^4 n) solution. Our solution builds on the search version (where we know the minimum distance lambda between the chosen nodes) for which we present tight Theta(n log n) upper and lower bounds.

BibTeX - Entry

@InProceedings{gawrychowski_et_al:LIPIcs:2017:7843,
  author =	{Pawel Gawrychowski and Nadav Krasnopolsky and Shay Mozes and Oren Weimann},
  title =	{{Dispersion on Trees}},
  booktitle =	{25th Annual European Symposium on Algorithms (ESA 2017)},
  pages =	{40:1--40:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-049-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{87},
  editor =	{Kirk Pruhs and Christian Sohler},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7843},
  URN =		{urn:nbn:de:0030-drops-78438},
  doi =		{10.4230/LIPIcs.ESA.2017.40},
  annote =	{Keywords: parametric search, dispersion, k-center, dynamic programming}
}

Keywords: parametric search, dispersion, k-center, dynamic programming
Seminar: 25th Annual European Symposium on Algorithms (ESA 2017)
Issue Date: 2017
Date of publication: 31.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI