Facility location in sublinear time
From MaRDI portal
Recommendations
Cited in
(18)- A sublinear-time approximation scheme for bin packing
- A concentration inequality for the facility location problem
- Sublinear time algorithms for metric space problems
- Approximating average parameters of graphs
- Facility Location in Dynamic Geometric Data Streams
- Line Segment Facility Location in Weighted Subdivisions
- scientific article; zbMATH DE number 2079337 (Why is no real title available?)
- Sublinear-time Algorithms
- Online facility location with deletions
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- Separating Sublinear Time Computations by Approximate Diameter
- (1 + )-approximation for facility location in data streams
- Sublinear time approximation of the cost of a metric k-nearest neighbor graph
- Fully-scalable MPC algorithms for clustering in high dimension
- Sub-logarithmic distributed algorithms for metric facility location
- Separating sublinear time computations by approximate diameter
- Small space representations for metric min-sum k-clustering and their applications
- Kinetic facility location
This page was built for publication: Facility location in sublinear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716835)