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

Geometric complexity of some location problems

โœ Scribed by D. T. Lee; Y. F. Wu

Publisher
Springer
Year
1986
Tongue
English
Weight
865 KB
Volume
1
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Planar geometric location problems
Planar geometric location problems
โœ Pankaj K. Agarwal; Micha Sharir ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Springer ๐ŸŒ English โš– 632 KB
On the complexity of some geometric prob
On the complexity of some geometric problems in unbounded dimension
โœ Nimrod Megiddo ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 429 KB

This paper examines the complexity of several geometric problems due to unbounded dimension. The problems considered are: (i) minimum cover of points by unit cubes, (ii) minimum cover of points by unit ball% and (iii) minimum number of lines to hit a set of balls. Each of these problems is proven no

Location problems with grouped structure
Location problems with grouped structure of demand: Complexity and algorithms
โœ Averbakh, Igor; Berman, Oded ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB

We study generalizations of classical multifacility location problems, where customers' demand has a hierarchial structure, i.e., the set of local customers is partitioned into categories (global customers), each having its own requirements for quality of service. For the case of identical facilitie