Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Metric_k-center> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- Metric_k-center abstract "In graph theory, the metric k-center or metric facility location 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, 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 wikiPageLength "5824".
- Metric_k-center wikiPageOutDegree "23".
- Metric_k-center wikiPageRevisionID "681771366".
- Metric_k-center wikiPageWikiLink Approximation_algorithm.
- Metric_k-center wikiPageWikiLink Category:Approximation_algorithms.
- Metric_k-center wikiPageWikiLink Category:Combinatorial_optimization.
- Metric_k-center wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Metric_k-center wikiPageWikiLink Category:NP-complete_problems.
- Metric_k-center wikiPageWikiLink Combinatorial_optimization.
- Metric_k-center wikiPageWikiLink Complete_graph.
- Metric_k-center wikiPageWikiLink Dominating_set.
- Metric_k-center wikiPageWikiLink Facility_location_problem.
- Metric_k-center wikiPageWikiLink Farthest-first_traversal.
- Metric_k-center wikiPageWikiLink Graph_theory.
- Metric_k-center wikiPageWikiLink Greedy_algorithm.
- Metric_k-center wikiPageWikiLink Independent_set_(graph_theory).
- Metric_k-center wikiPageWikiLink Minimum_k-cut.
- Metric_k-center wikiPageWikiLink NP-Hard.
- Metric_k-center wikiPageWikiLink NP-complete.
- Metric_k-center wikiPageWikiLink NP-completeness.
- Metric_k-center wikiPageWikiLink NP-hard.
- Metric_k-center wikiPageWikiLink NP-hardness.
- Metric_k-center wikiPageWikiLink Theoretical_computer_science.
- Metric_k-center wikiPageWikiLink Traveling_salesman_problem.
- Metric_k-center wikiPageWikiLink Travelling_salesman_problem.
- Metric_k-center wikiPageWikiLink Triangle_inequality.
- Metric_k-center wikiPageWikiLinkText "Metric k-center".
- Metric_k-center wikiPageWikiLinkText "metric ''k''-center problem".
- Metric_k-center wikiPageWikiLinkText "metric ''k''-center".
- Metric_k-center hasPhotoCollection Metric_k-center.
- Metric_k-center wikiPageUsesTemplate Template:Citation.
- 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 hypernym Problem.
- Metric_k-center type Disease.
- Metric_k-center type Algorithm.
- Metric_k-center comment "In graph theory, the metric k-center or metric facility location 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.".
- Metric_k-center label "Metric k-center".
- Metric_k-center sameAs K-centre.
- Metric_k-center sameAs בעיית_k_המרכזים.
- Metric_k-center sameAs m.09k5mjk.
- Metric_k-center sameAs Q6824324.
- Metric_k-center sameAs Q6824324.
- Metric_k-center wasDerivedFrom Metric_k-center?oldid=681771366.
- Metric_k-center isPrimaryTopicOf Metric_k-center.