Algorithms for Euclidean Degree Bounded Spanning Tree Problems.
Patrick J. AndersenCharl J. RasPublished in: Int. J. Comput. Geom. Appl. (2019)
Keyphrases
- spanning tree
- optimization problems
- run times
- minimum spanning tree
- computational complexity
- combinatorial optimization
- evolutionary algorithm
- benchmark problems
- worst case
- data structure
- minimum cost
- problems in computer vision
- computational problems
- edge disjoint
- minimum weight
- graph theory
- traveling salesman problem
- simulated annealing