A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Algorithms for clustering data
Algorithms for clustering data
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for geometric median problems
Information Processing Letters
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Various notions of approximations: good, better, best, and more
Approximation algorithms for NP-hard problems
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The p-neighbor k-center problem
Information Processing Letters
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fault tolerant K-center problems
Theoretical Computer Science
| Hi-index | 0.00 |
The bounded k-median problem is to select in an undirected graph G = (V, E) a set S of k vertices such that the maximum distance from a vertex v ∈ V to S is at most a given bound d and the average distance from vertices V to S is minimized. We present randomized algorithms for several versions of this problem. We also study the bounded version of the uncapacitated facility location problem. For this latter problem we present extensions of known deterministic algorithms for the unbounded version, and we prove some inapproximability results.