This HTML5 document contains 61 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n15http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n19https://web.archive.org/web/20060505084136/http:/iridia.ulb.ac.be/~cblum/kctlib/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://www.nada.kth.se/~viggo/wwwcompendium/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Approximation_algorithms_for_k-minimum_spanning_trees
dbo:wikiPageWikiLink
dbr:K-minimum_spanning_tree
dbo:wikiPageRedirects
dbr:K-minimum_spanning_tree
Subject Item
dbr:Spanning_tree_(disambiguation)
dbo:wikiPageWikiLink
dbr:K-minimum_spanning_tree
dbo:wikiPageDisambiguates
dbr:K-minimum_spanning_tree
Subject Item
dbr:K-minimum_spanning_tree
rdf:type
yago:State100024720 yago:WikicatNP-hardProblems yago:Difficulty114408086 yago:Condition113920835 yago:Problem114410605 yago:Attribute100024264 yago:Abstraction100002137
rdfs:label
K-minimum spanning tree
rdfs:comment
The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a subgraph of a larger graph. It is also called the k-MST or edge-weighted k-cardinality tree. Finding this tree is NP-hard, but it can be approximated to within a constant approximation ratio in polynomial time.
dcterms:subject
dbc:NP-hard_problems dbc:Spanning_tree
dbo:wikiPageID
1152079
dbo:wikiPageRevisionID
1045360433
dbo:wikiPageWikiLink
dbr:Polynomial_time dbr:Brute-force_search dbr:Treewidth dbr:Vertex_(graph_theory) dbr:Existential_theory_of_the_reals dbr:Euclidean_distance dbr:Planar_graph dbr:NP-complete dbr:NP-hard dbc:NP-hard_problems dbr:Euclidean_plane dbr:Approximation_algorithm n15:K-mst_1.pdf n15:K-mst_2.pdf n15:K-mst_3.pdf dbr:Theoretical_computer_science dbc:Spanning_tree dbr:Steiner_tree dbr:Undirected_graph dbr:Hardness_of_approximation dbr:Reduction_(complexity) dbr:Complete_graph dbr:Polynomial_time_approximation_scheme dbr:Approximation_ratio
dbo:wikiPageExternalLink
n13:node71.html n19:
owl:sameAs
yago-res:K-minimum_spanning_tree wikidata:Q6322849 n18:4oxja freebase:m.04brp6
dbp:wikiPageUsesTemplate
dbt:Math dbt:Mvar dbt:Reflist dbt:Harvtxt
dbo:abstract
The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a subgraph of a larger graph. It is also called the k-MST or edge-weighted k-cardinality tree. Finding this tree is NP-hard, but it can be approximated to within a constant approximation ratio in polynomial time.
prov:wasDerivedFrom
wikipedia-en:K-minimum_spanning_tree?oldid=1045360433&ns=0
dbo:wikiPageLength
8374
foaf:isPrimaryTopicOf
wikipedia-en:K-minimum_spanning_tree
Subject Item
dbr:K-Minimum_Spanning_Tree
dbo:wikiPageWikiLink
dbr:K-minimum_spanning_tree
dbo:wikiPageRedirects
dbr:K-minimum_spanning_tree
Subject Item
dbr:Minimum_spanning_tree
dbo:wikiPageWikiLink
dbr:K-minimum_spanning_tree
Subject Item
dbr:Minimum_k-spanning_tree
dbo:wikiPageWikiLink
dbr:K-minimum_spanning_tree
dbo:wikiPageRedirects
dbr:K-minimum_spanning_tree
Subject Item
wikipedia-en:K-minimum_spanning_tree
foaf:primaryTopic
dbr:K-minimum_spanning_tree