Pages that link to "Item:Q2377240"
From MaRDI portal
The following pages link to Deterministic sublinear-time approximations for metric 1-median selection (Q2377240):
Displaying 6 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)
- On approximating metric 1-median in sublinear time (Q2445898) (← links)
- Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter (Q6051928) (← links)