The p-neighbor k-center problem
✍
Shiva Chaudhuri; Naveen Garg; R. Ravi
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 389 KB
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 prob