Constant-factor approximation for ordered k-median
From MaRDI portal
Publication:5230325
DOI10.1145/3188745.3188930zbMath1427.68366arXiv1711.01972MaRDI QIDQ5230325
Joachim Spoerhase, Jaroslaw Byrka, Krzysztof Sornat
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.01972
Related Items
Simpler and Better Algorithms for Minimum-Norm Load Balancing, Unnamed Item, Tight approximation algorithms for ordered covering, Approximation algorithms for clustering with dynamic points, Reverse greedy is bad for \(k\)-center, The ordered \(k\)-median problem: surrogate models and approximation algorithms