Journal of Algorithms

Paper

01 Jan 1986

An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

View publication

Abstract

A randomizing algorithm for the weighted Euclidean 1-center problem is presented. The algorithm is shown to run on any problem in O(nlogn) time with high probability. © 1986.

Related

Paper

Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time

Noga Alon, Nimrod Megiddo

Journal of the ACM (JACM)

Paper

On orientations and shortest paths

Rafael Hassin, Nimrod Megiddo

Linear Algebra and Its Applications

Paper

A sublinear parallel algorithm for stable matching

Tomás Feder, Nimrod Megiddo, et al.

Theoretical Computer Science

Conference paper

ArC: A self-tuning, low overhead replacement cache

Nimrod Megiddo, Dharmendra S. Modha

FAST 2003

View all publications