Approximation algorithms for min-sum p-clustering
- 1 December 1998
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 89 (1-3) , 125-142
- https://doi.org/10.1016/s0166-218x(98)00100-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Geometric algorithms for the minimum cost assignment problemRandom Structures & Algorithms, 1995
- P-Complete Approximation ProblemsJournal of the ACM, 1976