Sublinear time algorithms for metric space problems
From MaRDI portal
Publication:2819576
DOI10.1145/301250.301366zbMath1346.68256MaRDI QIDQ2819576
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301366
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
Sublinear-time Algorithms, Some results on approximate 1-median selection in metric spaces, Approximating the metric TSP in linear time, Approximate \(k\)-closest-pairs in large high-dimensional data sets, Algorithms for graphs of bounded treewidth via orthogonal range searching, Small space representations for metric min-sum \(k\)-clustering and their applications, The projection median of a set of points, A sublinear-time approximation scheme for bin packing, Fast approximations for sums of distances, clustering and the Fermat-Weber problem, Sublinear‐time approximation algorithms for clustering via random sampling, Approximating average parameters of graphs