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

Using fast matrix multiplication to find basic solutions

Peter A. Beling, Nimrod Megiddo

Theoretical Computer Science

Paper

On the complexity of polyhedral separability

Nimrod Megiddo

Discrete and Computational Geometry

Paper

A linear programming instance with many crossover events

Shinji Mizuno, Nimrod Megiddo, et al.

Journal of Complexity

Paper

Linear time algorithms for some separable quadratic programming problems

Nimrod Megiddo, Arie Tamir

Operations Research Letters

View all publications