You're using an outdated browser. Please upgrade to a modern browser for the best experience.
Vertex K-Center Problem
Academic Video Service
  • View Times: 19
  • |
  • 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
Read Related Entry >>
Academic Video Service