Heuristic Algorithms with Near Optimal Broadcasting in Cactus Graphs.
Neil ConlanHovhannes A. HarutyunyanEdward MaraachlianPublished in: PDP (2020)
Keyphrases
- graph theory
- learning algorithm
- computationally efficient
- data structure
- orders of magnitude
- combinatorial optimization
- running times
- depth first search
- approximate solutions
- hill climbing
- optimization problems
- significant improvement
- spanning tree
- theoretical analysis
- minimum spanning tree
- worst case
- greedy heuristic