10 citations · 23 across the 21 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
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…
cs.DS2017★ 1 cited
Fully-Dynamic Bin Packing with Limited Repacking
Anupam Gupta, Guru Guruganesh, Amit Kumar +1
We study the classic Bin Packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio \…