Pages that link to "Item:Q2445898"
From MaRDI portal
The following pages link to On approximating metric 1-median in sublinear time (Q2445898):
Displaying 10 items.
- A lower bound for metric 1-median selection (Q340556) (← links)
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection (Q497691) (← links)
- On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
- Deterministic sublinear-time approximations for metric 1-median selection (Q2377240) (← links)
- Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored (Q2695287) (← links)
- Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
- Sublinear time algorithms for metric space problems (Q2819576) (← links)
- Automata, Languages and Programming (Q5716835) (← links)
- Deterministic metric 1-median selection with very few queries (Q6590087) (← links)