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

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 450 - 461
Main Authors:	Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert, Vesely, Pavel, Yang, Mingwei
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!