Lars Rohwedder

According to our database, Lars Rohwedder authored at least 35 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A k-swap Local Search for Makespan Scheduling.

Lars Rohwedder, Ashkan Safari, Tjark Vredeveld

CoRR, 2024

Simpler constant factor approximation algorithms for weighted flow time - now for any <i>p</i>-norm.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Santa Claus meets Makespan and Matroids: Algorithms and Reductions.

Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Online cardinality constrained scheduling.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Oper. Res. Lett., September, 2023

On Integer Programming, Discrepancy, and Convolution.

Klaus Jansen, Lars Rohwedder

Math. Oper. Res., August, 2023

Online bin covering with limited migration.

Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder

J. Comput. Syst. Sci., June, 2023

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

CoRR, 2023

Better Trees for Santa Claus.

Étienne Bamas, Lars Rohwedder

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A PTAS for Minimizing Weighted Flow Time on a Single Machine.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.

Kim-Manuel Klein, Adam Polak, Lars Rohwedder

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimizing Low Dimensional Functions over the Integers.

Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Flow time scheduling and prefix Beck-Fiala.

Nikhil Bansal, Lars Rohwedder, Ola Svensson

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Cardinality Constrained Scheduling in Online Models.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Towards Non-Uniform <i>k</i>-Center with Constant Types of Radii.

Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Load Balancing: The Long Road from Theory to Practice.

Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Approximation Results for Makespan Minimization with Budgeted Uncertainty.

Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder

Theory Comput. Syst., 2021

Towards Non-Uniform k-Center with Constant Types of Radii.

Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson

CoRR, 2021

A (2 + <i>ε</i>)-approximation algorithm for preemptive weighted flow time on a single machine.

Lars Rohwedder, Andreas Wiese

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.

Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Additive Approximation Schemes for Load Balancing Problems.

Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

The Submodular Santa Claus Problem in the Restricted Assignment Case.

Étienne Bamas, Paritosh Garg, Lars Rohwedder

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Knapsack and Subset Sum with Small Items.

Adam Polak, Lars Rohwedder, Karol Wegrzycki

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.

Klaus Jansen, Alexandra Lassota, Lars Rohwedder

SIAM J. Discret. Math., 2020

A Quasi-Polynomial Approximation for the Restricted Assignment Problem.

Klaus Jansen, Lars Rohwedder

SIAM J. Comput., 2020

A note on the integrality gap of the configuration LP for restricted Santa Claus.

Klaus Jansen, Lars Rohwedder

Inf. Process. Lett., 2020

A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine.

Lars Rohwedder, Andreas Wiese

CoRR, 2020

The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs.

Étienne Bamas, Paritosh Garg, Lars Rohwedder

CoRR, 2020

Learning Augmented Energy Minimization via Speed Scaling.

Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Robust Algorithms Under Adversarial Injections.

Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Algorithms for Integer Programming and Allocation.

Lars Rohwedder

PhD thesis, 2019

On Integer Programming and Convolution.

Klaus Jansen, Lars Rohwedder

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Local Search Breaks 1.75 for Graph Balancing.

Klaus Jansen, Lars Rohwedder

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Compact LP Relaxations for Allocation Problems.

Klaus Jansen, Lars Rohwedder

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

2017

On the Configuration-LP of the Restricted Assignment Problem.

Klaus Jansen, Lars Rohwedder

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Structured Instances of Restricted Assignment with Two Processing Times.

Klaus Jansen, Lars Rohwedder

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017