On p -Centers in Networks

S. L. Hakimi, E. F. Schmeichel and J. G. Pierce
Additional contact information
S. L. Hakimi: Northwestern University, Evanston, Illinois
E. F. Schmeichel: University of Southern California, Los Angeles, California
J. G. Pierce: California State University, Fullerton, California

Transportation Science, 1978, vol. 12, issue 1, 1-15

Abstract: This paper presents some improvements and some generalizations of existing techniques for computing a 1-center of a network and a p -center of a tree. For a network with n vertices and | E | edges the amount of computation to find a 1-center is shown to be at most 0(| E | n 2 log n ) in the vertex weighted case and 0(| E | n log n ) in the vertex unweighted; for a p -center of a tree ( p > 1, unweighted case), the bound is 0( n p -1 ).

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.1.1 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:12:y:1978:i:1:p:1-15

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().