Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
2015
In the Minimum Bounded Degree Spanning Tree problem, we are given an undirected graph G = (V, E) with a degree upper bound Bv on each vertex v V, and the task is to find a spanning tree of minimum ...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI