An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
- 30 September 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (3) , 358-368
- https://doi.org/10.1016/0196-6774(86)90027-1
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- An O(n) algorithm for the linear multiple choice knapsack problem and related problemsInformation Processing Letters, 1984
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- The weighted euclidean 1-center problemOperations Research Letters, 1982
- Expected time bounds for selectionCommunications of the ACM, 1975
- Optimal location of a single service center of certain typesNaval Research Logistics Quarterly, 1971
- Algorithm 64: QuicksortCommunications of the ACM, 1961