activity
20132026
most citedWhat's Wrong with Deep Learning in Tree Search for Combinatorial Optimization

10 citations · 15 across the 17 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.DS2017

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

Moab Arar, Shiri Chechik, Sarel Cohen +2

We present a simple randomized reduction from fully-dynamic integral matching algorithms to fully-dynamic "approximately-maximal" fractional matching algorithms. Applying this redu…