32 citations · 32 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
Niv Buchbinder, Joseph, Naor +1
For numerous online bipartite matching problems, such as edge-weighted matching and matching under two-sided vertex arrivals, the state-of-the-art fractional algorithms outperform…
cs.DS2021
General Knapsack Problems in a Dynamic Setting
Yaron Fairstein, Ariel Kulik, Joseph +2
The world is dynamic and changes over time, thus any optimization problem used to model real life problems must address this dynamic nature, taking into account the cost of changes…