Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs.
Tahsin RezaTrevor SteilGeoffrey SandersRoger PearcePublished in: J. Parallel Distributed Comput. (2023)
Keyphrases
- weighted graph
- steiner tree
- undirected graph
- minimum spanning tree
- edge weights
- shortest path
- spanning tree
- directed graph
- labeled graphs
- vertex set
- bipartite graph
- graph structure
- approximation algorithms
- facility location
- densely connected
- directed acyclic graph
- attributed graphs
- computer networks
- minimum cost
- computational complexity
- data objects
- ant colony optimization
- dynamic programming
- evolutionary algorithm