Metric k-center
Combinatorial optimization problem / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Metric k-center?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In graph theory, the metric k-center problem is a combinatorial optimization problem studied in theoretical computer science. Given n cities with specified distances, one wants to build k warehouses in different cities and minimize the maximum distance of a city to a warehouse. In graph theory, this means finding a set of k vertices for which the largest distance of any point to its closest vertex in the k-set is minimum. The vertices must be in a metric space, providing a complete graph that satisfies the triangle inequality.
Vertex k-center problem is in the process of being merged into this article. If possible, please edit only this article, as the article mentioned above may be turned into a redirect. Relevant discussion may be found on this article's talk page and/or the source article's talk page. (November 2023) |