𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A combinatorial algorithm for the 1-median problem in with the Chebyshev norm

✍ Scribed by Johannes Hatzl; Andreas Karrenbauer

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
238 KB
Volume
38
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A branch-and-price algorithm for the cap
A branch-and-price algorithm for the capacitated p-median problem
✍ Alberto Ceselli; Giovanni Righini πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 178 KB πŸ‘ 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We