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

A unified approach to interior point algorithms for linear complementarity problems: A summary

Masakazu Kojima, Nimrod Megiddo, et al.

Operations Research Letters

Paper

On total functions, existence theorems and computational complexity

Nimrod Megiddo, Christos H. Papadimitriou

Theoretical Computer Science

Paper

On finding a minimum dominating set in a tournament

Nimrod Megiddo, Uzi Vishkin

Theoretical Computer Science

Paper

Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time

Noga Alon, Nimrod Megiddo

Journal of the ACM (JACM)

View all publications