Lars Rohwedder

From MaRDI portal
Person:2193080

Available identifiers

zbMath Open rohwedder.larsMaRDI QIDQ2193080

List of research outcomes





PublicationDate of PublicationType
Santa claus meets makespan and matroids: algorithms and reductions2024-11-28Paper
Online cardinality constrained scheduling2024-06-17Paper
Simpler constant factor approximation algorithms for weighted flow time -- now for any \(p\)-norm2024-05-29Paper
Load balancing: the long road from theory to practice2024-05-24Paper
On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs2024-05-14Paper
Towards non-uniform \(k\)-center with constant types of radii2024-05-14Paper
A PTAS for minimizing weighted flow time on a single machine2024-05-08Paper
Better trees for Santa Claus2024-05-08Paper
Cardinality constrained scheduling in online models2024-04-23Paper
On Integer Programming, Discrepancy, and Convolution2024-02-27Paper
https://portal.mardi4nfdi.de/entity/Q61473562024-01-15Paper
Flow time scheduling and prefix Beck-Fiala2023-12-08Paper
A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine2023-11-14Paper
Optimizing low dimensional functions over the integers2023-11-09Paper
Online bin covering with limited migration2023-03-10Paper
https://portal.mardi4nfdi.de/entity/Q50912332022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50912342022-07-21Paper
On integer programming and convolution2022-07-18Paper
Online Bin Covering with Limited Migration2022-05-11Paper
Approximation results for makespan minimization with budgeted uncertainty2021-09-28Paper
Near-linear time algorithm for \(n\)-fold ILPs via color coding2020-12-04Paper
A quasi-polynomial approximation for the restricted assignment problem2020-12-04Paper
A note on the integrality gap of the configuration LP for restricted Santa Claus2020-10-07Paper
Approximation results for makespan minimization with budgeted uncertainty2020-08-24Paper
Compact LP relaxations for allocation problems2019-10-25Paper
On the configuration-LP of the restricted assignment problem2018-07-16Paper
A quasi-polynomial approximation for the restricted assignment problem2017-08-31Paper
Structured instances of restricted assignment with two processing times2017-04-07Paper

Research outcomes over time

This page was built for person: Lars Rohwedder