49 citations · 49 across the 1 of their papers we have counts for
1 paper
S. Fekete, S. Khuller, M. Klemmstein +2
The problem considered is the following. Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, compute a low-weight spanning tree…