A 2-Approximation Algorithm for Data-Distributed Metric k-Center

In a metric space, a set of point sets of roughly the same size and an integer $k\geq 1$ are given as the input and the goal of data-distributed $k$-center is to find a subset of size $k$ of the input points as the set of centers to minimize the maximum distance from the input points to their closes...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Aghamolaei, Sepideh, Ghodsi, Mohammad
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Geometry Computer Science - Distributed, Parallel, and Cluster Computing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!