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 the geometric separability of Boolean functions

Tibor Hegedus, Nimrod Megiddo

Discrete Applied Mathematics

Paper

New algorithms for generalized network flows

Edith Cohen, Nimrod Megiddo

Mathematical Programming

Paper

A linear programming instance with many crossover events

Shinji Mizuno, Nimrod Megiddo, et al.

Journal of Complexity

Paper

Using fast matrix multiplication to find basic solutions

Peter A. Beling, Nimrod Megiddo

Theoretical Computer Science

View all publications