𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for the hierarchical median problem

✍ Scribed by V. V. Shenmaier

Book ID
111471217
Publisher
Pleiades Publishing
Year
2009
Tongue
English
Weight
449 KB
Volume
3
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximation algorithm for the prece
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude KΓΆnig πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary

A Constant-Factor Approximation Algorith
A Constant-Factor Approximation Algorithm for the k-Median Problem
✍ Moses Charikar; Sudipto Guha; Γ‰va Tardos; David B. Shmoys πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 165 KB

We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are rel