14 citations · 21 across the 20 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Simpler constant factor approximation algorithms for weighted flow time -- now for any -norm
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized by a processing time…
cs.DS2023
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
Étienne Bamas, Alexander Lindermayr, Nicole Megow +2
In this paper we study the relation of two fundamental problems in scheduling and fair allocation: makespan minimization on unrelated parallel machines and max-min fair allocation,…
cs.DS2023
Optimizing Low Dimensional Functions over the Integers
Daniel Dadush, Arthur Léonard, Lars Rohwedder +1
We consider box-constrained integer programs with objective , where is a "complicated" function with an dimensional domain. Here we assume we have …