Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Metric_k-center> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- Metric_k-center abstract "In graph theory, the metric k-center, 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, or in other words a complete graph that satisfies the triangle inequality.".
- Metric_k-center wikiPageExternalLink node128.html.
- Metric_k-center wikiPageID "25385291".
- Metric_k-center wikiPageRevisionID "575631203".
- Metric_k-center hasPhotoCollection Metric_k-center.
- Metric_k-center subject Category:Approximation_algorithms.
- Metric_k-center subject Category:Combinatorial_optimization.
- Metric_k-center subject Category:Computational_problems_in_graph_theory.
- Metric_k-center subject Category:NP-complete_problems.
- Metric_k-center type Abstraction100002137.
- Metric_k-center type Act100030358.
- Metric_k-center type Activity100407535.
- Metric_k-center type Algorithm105847438.
- Metric_k-center type ApproximationAlgorithms.
- Metric_k-center type Attribute100024264.
- Metric_k-center type ComputationalProblemsInGraphTheory.
- Metric_k-center type Condition113920835.
- Metric_k-center type Difficulty114408086.
- Metric_k-center type Event100029378.
- Metric_k-center type NP-completeProblems.
- Metric_k-center type Problem114410605.
- Metric_k-center type Procedure101023820.
- Metric_k-center type PsychologicalFeature100023100.
- Metric_k-center type Rule105846932.
- Metric_k-center type State100024720.
- Metric_k-center type YagoPermanentlyLocatedEntity.
- Metric_k-center comment "In graph theory, the metric k-center, 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.".
- Metric_k-center label "Metric k-center".
- Metric_k-center sameAs m.09k5mjk.
- Metric_k-center sameAs Q6824324.
- Metric_k-center sameAs Q6824324.
- Metric_k-center sameAs Metric_k-center.
- Metric_k-center wasDerivedFrom Metric_k-center?oldid=575631203.
- Metric_k-center isPrimaryTopicOf Metric_k-center.