Abstract
Let V be the set of nodes of a complete undirected graph of n nodes with edge weights cij ≥ 0 associated with edge (i,j) for all nodes i, j in V; and cii = 0. Given an integer k, l ≤ k ≤ n, the k-center location problem is to find a subset S of V of size at most k such that
is minimized.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes
The two-approximation algorithm for the k-center problem with triangle inequality is credited to D. S. Hochbaum and D. B. Shmoys, “A best possible heuristic for the k-center problem”, Mathematics of Operations Research 10(1985), 180–184.
The sorting subroutine uses the heapsort method which originated with J.W.J. Williams, “Algorithm 232: Heapsort”, Communications of the ACM 7(1964), 347–348,
and was improved by R. W. Floyd, “Algorithm 245: Treesort 3”, Communications of the ACM 7(1964), 701.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lau, H.T. (1986). K-Center Location. In: Combinatorial Heuristic Algorithms with FORTRAN. Lecture Notes in Economics and Mathematical Systems, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61649-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-61649-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17161-4
Online ISBN: 978-3-642-61649-5
eBook Packages: Springer Book Archive