Metric k-center
id:
metric-k-center-189-5524900
title:
Metric k-center
text:
In graph theory, the metric k-center problem or vertex k-center problem is a classical combinatorial optimization problem studied in theoretical computer science that is NP-hard. 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
brand slug:
wiki
category slug:
encyclopedia
description:
Combinatorial optimization problem
original url:
https://en.wikipedia.org/wiki/Metric_k-center
date created:
2009-12-10T15:29:47Z
date modified:
2024-09-09T08:52:50Z
main entity:
{"identifier":"Q6824324","url":"https://www.wikidata.org/entity/Q6824324"}
image:
fields total:
13
integrity:
15