License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2016.52
URN: urn:nbn:de:0030-drops-68248
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6824/
Go to the corresponding LIPIcs Volume Portal


Li, Shimin ; Wang, Haitao

Dispersing Points on Intervals

pdf-format:
LIPIcs-ISAAC-2016-52.pdf (0.6 MB)


Abstract

We consider a problem of dispersing points on disjoint intervals on a line. Given n pairwise disjoint intervals sorted on a line, we want to find a point in each interval such that the minimum pairwise distance of these points is maximized. Based on a greedy strategy, we present a linear time algorithm for the problem. Further, we also solve in linear time the cycle version of the problem where the intervals are given on a cycle.

BibTeX - Entry

@InProceedings{li_et_al:LIPIcs:2016:6824,
  author =	{Shimin Li and Haitao Wang},
  title =	{{Dispersing Points on Intervals}},
  booktitle =	{27th International Symposium on Algorithms and Computation (ISAAC 2016)},
  pages =	{52:1--52:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-026-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{64},
  editor =	{Seok-Hee Hong},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6824},
  URN =		{urn:nbn:de:0030-drops-68248},
  doi =		{10.4230/LIPIcs.ISAAC.2016.52},
  annote =	{Keywords: dispersing points, intervals, min-max, algorithms, cycles}
}

Keywords: dispersing points, intervals, min-max, algorithms, cycles
Seminar: 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Issue Date: 2016
Date of publication: 02.12.2016


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