The metric k-center problem, also called the vertex k-center problem, is a classical NP-hard combinatorial optimization problem in theoretical computer science. Given a set of cities and the distances between them, it asks for the placement of k warehouses among the cities so as to minimize the maximum distance from any city to its nearest warehouse. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design Technique Design TechniqueHeuristic or Approximation 1 Connections
Sources
1. Wikipedia: Vertex k-center problem
- Design Technique: Greedy
- Design Technique: Heuristic or Approximation
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.