29 citations · 45 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 5 cited
Faster Matchings via Learned Duals
Michael Dinitz, Sungjin Im, Thomas Lavastida +2
A recent line of research investigates how algorithms can be augmented with machine-learned predictions to overcome worst case lower bounds. This area has revealed interesting algo…
cs.DS2021
Partially Optimal Edge Fault-Tolerant Spanners
Greg Bodwin, Michael Dinitz, Caleb Robelle
Recent work has established that, for every positive integer , every -node graph has a -spanner on edges that is resilient to edge or ver…