1 citations · 2 across the 20 of their papers we have counts for
3 papers · 1 filter
Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
Michael Dinitz, Jeremy T. Fineman, Seeun William Umboh
This paper considers using predictions in the context of the online Joint Replenishment Problem with Deadlines (JRP-D). Prior work includes asymptotically optimal competitive ratio…
Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
Clément L. Canonne, Yun Li, Seeun William Umboh
Local Computation Algorithms (LCA), as introduced by Rubinfeld, Tamir, Vardi, and Xie (2011), are a type of ultra-efficient algorithms which, given access to a (large) input for a…
Colorful Vertex Recoloring of Bipartite Graphs
Boaz Patt-Shamir, Adi Rosen, Seeun William Umboh
In vertex recoloring, we are given vertices with their initial coloring, and edges arrive in an online fashion. The algorithm must maintain a valid coloring by recoloring verti…