An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
From MaRDI portal
Publication:3753765
DOI10.1016/0196-6774(86)90027-1zbMath0612.90033OpenAlexW2083706862WikidataQ63549482 ScholiaQ63549482MaRDI QIDQ3753765
Publication date: 1986
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(86)90027-1
Related Items
Computing the Center of Uncertain Points on Tree Networks ⋮ A linear time randomizing algorithm for searching ranked functions ⋮ Prune-and-search with limited workspace ⋮ Computing the center of uncertain points on tree networks ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Extending NC and RNC algorithms ⋮ On the ball spanned by balls