Streaming Facility Location in High Dimension via Geometric Hashing

In Euclidean Uniform Facility Location, the input is a set of clients in \mathrm{R}^{d} and the goal is to place facilities to serve them, so as to minimize the total cost of opening facilities plus connecting the clients. We study the classical setting of dynamic geometric streams, where the client...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / annual Symposium on Foundations of Computer Science S. 450 - 461
Hauptverfasser:	Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert, Vesely, Pavel, Yang, Mingwei
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.10.2022
Schlagworte:	Approximation algorithms Complexity theory Computer science Costs facility location hash functions Heuristic algorithms high dimension Monte Carlo methods streaming algorithms sublinear algorithms
ISSN:	2575-8454
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!