scispace - formally typeset
Journal ArticleDOI

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

S. L. Hakimi
- 01 Jun 1964 - 
- Vol. 12, Iss: 3, pp 450-459
TLDR
It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection.
Abstract
The concepts of the "center" and the "median vertex" of a graph are generalized to the "absolute center" and the "absolute median" of a weighted graph a graph with weights attached to its vertices as well as to its branches. These results are used to find the optimum location of a "switching center" in a communication network and to locate the best place to build a "police station" in a highway system. It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection. Procedures for finding these locations are given.

read more

Citations
More filters
Journal ArticleDOI

Centrality in social networks conceptual clarification

TL;DR: In this article, three distinct intuitive notions of centrality are uncovered and existing measures are refined to embody these conceptions, and the implications of these measures for the experimental study of small groups are examined.
Journal ArticleDOI

The maximal covering location problem

TL;DR: The use of a maximal service distance as a measure of the value of a given locational configuration has been discussed at length by Toregas and ReVelle 1 who show that it is an important surrogate measurement for the value.
Journal ArticleDOI

The location of emergency service facilities

TL;DR: In this paper, the location of emergency facilities is viewed as a set covering problem with equal costs in the objective, where sets are composed of the potential facility points within a specified time or
Journal ArticleDOI

An Algorithmic Approach to Network Location Problems. II: The p-Medians

TL;DR: An algorithm is presented which finds a p-median of a tree (for $p > 1$) in time $O(n^2 \cdot p^2 )$.
Journal ArticleDOI

Strategic facility location: A review

TL;DR: This review reports on literature which explicitly addresses the strategic nature of facility location problems by considering either stochastic or dynamic problem characteristics, with applications ranging across numerous industries.
References
More filters
Book

Theory of graphs

Oystein Ore
TL;DR: In this article, the axiom of choice of choice is used to define connectedness path problems in directed graphs and cyclic graphs, as well as Galois correspondences of connectedness paths.
Book

The theory of graphs

Claude Berge, +1 more