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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 450 - 461
Hlavní autori:	Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert, Vesely, Pavel, Yang, Mingwei
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!