Vertex K-Center Problem
  • View Times: 3
  • |
  • Release Date: 2024-03-29
  • k-center
  • facility location
Video Introduction

K-center problems are particular cases of the facility location problem, where a set of optimal centers are to be found given a set of constraints. In a nutshell, a k-center problem usually seeks a set of at most k centers that minimize the distance a client must travel to its nearest center. Namely, their objective function is often a minmax one. Naturally, these problems are well suited for modeling real location problems. Although many different problems fit within the description of a k-center problem, the most popular of these is the vertex k-center problem, where the input is a simple graph and an integer k, and the goal is to find at most k vertices whose distance to the remaining vertices is minimal.

Full Transcript


Are you sure to Delete?
If you have any further questions, please contact Encyclopedia Editorial Office.
García Díaz, J. Vertex K-Center Problem. Encyclopedia. Available online: (accessed on 19 April 2024).
García Díaz J. Vertex K-Center Problem. Encyclopedia. Available at: Accessed April 19, 2024.
García Díaz, Jesús. "Vertex K-Center Problem" Encyclopedia, (accessed April 19, 2024).
García Díaz, J. (2024, March 29). Vertex K-Center Problem. In Encyclopedia.
García Díaz, Jesús. "Vertex K-Center Problem." Encyclopedia. Web. 29 March, 2024.