Dispersion on Intervals

Given a set of n disjoint intervals on a line and an integer k, we want to find k points in the intervals so that the minimum pairwise distance of the k points is maximized. Intuitively, given a set of n disjoint time intervals on a timeline, each of which is a time span we are allowed to check some...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2022/09/01, Vol.E105.A(9), pp.1181-1186
Hauptverfasser:	ARAKI, Tetsuya, MIYATA, Hiroyuki, NAKANO, Shin-ichi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Disks Dispersion dispersion problem facility location Integers Intervals
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!