Skip to search formSkip to main contentSkip to account menu

K-minimum spanning tree

Known as: Minimum k-spanning tree 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Euclidean distanceExistential theory of the realsMinimum spanning treePlanar graph

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Simulated annealing algorithm with restart strategy for optimizing k-minimum spanning tree problems
2016
2016
Robust and Survivable Network Design Considering Uncertain Node and Link Failures
The network design is a planning process of placing system components to provide service or meet certain needs in an economical… 
2014
2014
Overlay routing network construction by introducing Super-Relay nodes
Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. However, deploying a… 
2012
2012
A Hybrid Algorithm Based on Memetic Algorithm and Tabu Search for k-Minimum Spanning Tree Problems
A combinatorial optimization problem, namely kMinimum Spanning Tree Problem, is to find a subtree with exactly k edges in an… 
2010
2010
A memetic algorithm based on tabu search for k-minimum spanning tree problems
1984
1984
On Some Properties of the En&l Andhmst*
This report studies the statistical behavior of some parameters defined in a graph, such as are used in pattern recognition and… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)