Deterministic metric 1-median selection with very few queries
From MaRDI portal
Publication:6590087
DOI10.1016/j.tcs.2024.114720MaRDI QIDQ6590087
Publication date: 21 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for metric 1-median selection
- Some results on approximate 1-median selection in metric spaces
- Optimal time bounds for approximate clustering
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- On approximating metric 1-median in sublinear time
- Introduction to algorithms
- Sublinear time algorithms for metric space problems
- Sublinear‐time approximation algorithms for clustering via random sampling
- Approximating average parameters of graphs
- Linear-time approximation schemes for clustering problems in any dimensions
- A new greedy approach for facility location problems
- Fast Approximation of Centrality
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Metric 1-Median Selection
- Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets
This page was built for publication: Deterministic metric 1-median selection with very few queries
