An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
From MaRDI portal
Recommendations
- Some results on approximate 1-median selection in metric spaces
- On Las Vegas approximations for metric 1-median selection
- Deterministic sublinear-time approximations for metric 1-median selection
- An approximate median search algorithm in non-metric spaces
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
Cited in
(13)- On Las Vegas approximations for metric 1-median selection
- An efficient noisy binary search in graphs via Median approximation
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- On approximating metric 1-median in sublinear time
- Efficient algorithms for the round-trip 1-center and 1-median problems
- An approximate median search algorithm in non-metric spaces
- Finding the Median (Obliviously) with Bounded Space
- Efficient Algorithms for the Capacitated 1-Median Problem
- Some results on approximate 1-median selection in metric spaces
- scientific article; zbMATH DE number 2090207 (Why is no real title available?)
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
- Experimental and Efficient Algorithms
- Algorithms with mediant convergents and their metrical theory
This page was built for publication: An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470203)