17 citations · 91 across the 27 of their papers we have counts for
1 paper · 2 filters
Thomas Erlebach, Michael Hoffmann, Danny Krizanc +2
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the graph only…