{"version":"1.0","type":"link","title":"K-minimum spanning tree - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/0/05/K-mst_1.pdf/page1-250px-K-mst_1.pdf.jpg","thumbnail_width":800,"thumbnail_height":575}