37 citations · 142 across the 37 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018★ 1 cited
Distributed Algorithms for Minimum Degree Spanning Trees
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree for graph with vertices, such that the maximum degree of is t…
cs.DS2018
Simple and Local Independent Set Approximation
Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
We bound the performance guarantees that follow from Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach o…