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

On total functions, existence theorems and computational complexity

Nimrod Megiddo, Christos H. Papadimitriou

Theoretical Computer Science

Paper

On the geometric separability of Boolean functions

Tibor Hegedus, Nimrod Megiddo

Discrete Applied Mathematics

Paper

A sublinear parallel algorithm for stable matching

Tomás Feder, Nimrod Megiddo, et al.

Theoretical Computer Science

Paper

The complexity of two-person zero-sum games in extensive form

Daphne Koller, Nimrod Megiddo

Games and Economic Behavior

View all publications