Approximation algorithms for geometric median problems
- 21 December 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 44 (5) , 245-249
- https://doi.org/10.1016/0020-0190(92)90208-d
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984