𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomially bounded algorithms for locatingp-centers on a tree

✍ Scribed by R. Chandrasekaran; A. Tamir

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
661 KB
Volume
22
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Polynomial algorithms for center locatio
Polynomial algorithms for center location on spheres
✍ Mordechai Jaeger; Jeff Goldberg πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

When locating facilities over the earth or in space, a planar location model is no longer valid and we must use a spherical surface. In this article, we consider the oneand two-center problems on a sphere that contains n demand points. The problem is to locate facilities to minimize the maximum dist

A polynomial algorithm for thep-centdian
A polynomial algorithm for thep-centdian problem on a tree
✍ Tamir, Arie; PοΏ½rez-Brito, Dionisio; Moreno-PοΏ½rez, JosοΏ½ A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 108 KB πŸ‘ 2 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is