๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Self-location is no problem for conditionalization

โœ Scribed by D. J. Bradley

Book ID
106540839
Publisher
Springer Netherlands
Year
2010
Tongue
English
Weight
385 KB
Volume
182
Category
Article
ISSN
0039-7857

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The approximation gap for the metric fac
The approximation gap for the metric facility location problem is not yet closed
โœ Jaroslaw Byrka; Karen Aardal ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 150 KB

We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility location problem. We show that their algorithm does not close the gap with the lower bound on approximability, 1.463, by providing a construction of instances for which its approximation ratio is not

Exploiting self-canceling demand point a
Exploiting self-canceling demand point aggregation error for some planar rectilinear median location problems
โœ R.L. Francis; T.J. Lowe; M.B. Rayco; A. Tamir ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB

## Abstract When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of