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):
Displaying 10 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)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- An algorithm and a core set result for the weighted Euclidean one-center problem (Q2899026) (← links)
- Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (Q3760268) (← links)
