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 Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension

Ilan Adler, Nimrod Megiddo

Journal of the ACM

Paper

Extending NC and RNC algorithms

Nimrod Megiddo

Algorithmica

Paper

A modified layered-step interior-point algorithm for linear programming

Nimrod Megiddo, Shinji Mizuno, et al.

Mathematical Programming, Series B

Paper

On finding a minimum dominating set in a tournament

Nimrod Megiddo, Uzi Vishkin

Theoretical Computer Science

View all publications