6 citations · 11 across the 20 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Speed-Robust Scheduling -- Sand, Bricks, and Rocks
Franziska Eberle, Ruben Hoeksma, Nicole Megow +3
The speed-robust scheduling problem is a two-stage problem where given machines, jobs must be grouped into at most bags while the processing speeds of the given machine…
cs.DS2020
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility
José Correa, Paul Dütting, Felix Fischer +2
A prophet inequality states, for some , that the expected value achievable by a gambler who sequentially observes random variables and selects one of the…
cs.DS2020★ 6 cited
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
Chien-Chung Huang, Mathieu Mari, Claire Mathieu +2
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges form a planar…