A greedy algorithm for finding maximum spanning trees in infinite graphs.
Christopher Thomas RyanRobert L. SmithPublished in: Oper. Res. Lett. (2022)
Keyphrases
- greedy algorithm
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum spanning trees
- greedy algorithms
- undirected graph
- minimum cost
- greedy strategy
- worst case
- knapsack problem
- weighted graph
- set cover
- dynamic programming
- objective function
- total length
- edge weights
- greedy approximation algorithm
- influence maximization
- upper bound
- special case