Greedy heuristics for the bounded diameter minimum spanning tree problem

DOI10.1145/1498698.1498699zbMath1284.68299OpenAlexW1983511657MaRDI QIDQ5406193

Bryant A. Julstrom

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1498698.1498699

zbMATH Keywords

diameterspanning treesgreedy heuristicsbounded-diameter minimum spanning tree problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Finding bounded diameter minimum spanning tree in general graphs ⋮ Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Delay-constrained minimum shortest path trees and related problems

This page was built for publication: Greedy heuristics for the bounded diameter minimum spanning tree problem