Pages that link to "Item:Q3753765"
From MaRDI portal
The following pages link to An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem (Q3753765):
Displayed 7 items.
- Prune-and-search with limited workspace (Q473192) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- A linear time randomizing algorithm for searching ranked functions (Q1101237) (← links)
- Extending NC and RNC algorithms (Q1263974) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)