4 citations · 5 across the 17 of their papers we have counts for
4 papers · 1 filter
A General Framework for Matching with Delays
Sara Ahmadian, Shuchi Chawla, Ravi Kumar +2
We present a simple deterministic -competitive algorithm for the online minimum-cost perfect matching with delays (MPMD) problem on arbitrary, unknown metric spaces, whe…
Multi-Level Aggregation via Dual Fitting: An -Competitive Algorithm
Sara Ahmadian, Shuchi Chawla, Ravi Kumar +2
We present a new online algorithm for the well-known Multi-Level Aggregation Problem (MLAP) with arbitrary delay functions, achieving a -competitive ratio, where is the dep…
Online Flexible Busy Time Scheduling on Heterogeneous Machines
Gruia Calinescu, Adrian Calinescu, Sami Davies +2
We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform processing time arrive online with a deadline that becomes known to the…
Balancing Flow Time and Energy Consumption
Sami Davies, Samir Khuller, Shirley Zhang
In this paper, we study the following batch scheduling model: find a schedule that minimizes total flow time for uniform length jobs, with release times and deadlines, where th…