𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for geometric median problems

✍ Scribed by Jyh-Han Lin; Jeffrey Scott Vitter

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
359 KB
Volume
44
Category
Article
ISSN
0020-0190

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

Approximation Algorithms for Directed St
Approximation Algorithms for Directed Steiner Problems
✍ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.

Combinatorial Approximation Algorithms f
Combinatorial Approximation Algorithms for Generalized Flow Problems
✍ Jeffrey D Oldham πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier Β΅ v w for each arc v w . For every unit of flow entering the arc, Β΅ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi