Chaudhuri, Shiva ; Garg, Naveen ; Ravi, R. (1998) The p-neighbor k-center problem Information Processing Letters, 65 (3). pp. 131-134. ISSN 0020-0190
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.doi.org/10.1016/S0020-0190(97)00224-X
Abstract
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this problem where, given a number p, we wish to place k centers so as to minimize the maximum distance of any non-center node to its pth closest center. We derive a best possible approximation algorithm for this problem.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Design of Algorithms; Facility Location; Centers; Approximation Algorithms |
| ID Code: | 101269 |
| Deposited On: | 31 Jan 2018 09:10 |
| Last Modified: | 31 Jan 2018 09:10 |
Repository Staff Only: item control page
