Lars Rohwedder

CoRR, 2024

Fine-Grained Equivalence for Problems Related to Integer Linear Programming.

[BibT_eX]

[DOI]

CoRR, 2024

The Submodular Santa Claus Problem.

[BibT_eX]

[DOI]

Sarah Morell

CoRR, 2024

A k-swap Local Search for Makespan Scheduling.

[BibT_eX]

[DOI]

Ashkan Safari

Tjark Vredeveld

CoRR, 2024

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

[BibT_eX]

[DOI]

Alexander Armbruster

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Santa Claus meets Makespan and Matroids: Algorithms and Reductions.

[BibT_eX]

[DOI]

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

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems.

[BibT_eX]

[DOI]

Friedrich Eisenbrand

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Online cardinality constrained scheduling.

[BibT_eX]

[DOI]

Oper. Res. Lett., September, 2023

On Integer Programming, Discrepancy, and Convolution.

[BibT_eX]

[DOI]

Math. Oper. Res., August, 2023

Online bin covering with limited migration.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Alexander Armbruster

CoRR, 2023

Better Trees for Santa Claus.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Alexander Armbruster

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.

[BibT_eX]

[DOI]

Kim-Manuel Klein

Adam Polak

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

Optimizing Low Dimensional Functions over the Integers.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Flow time scheduling and prefix Beck-Fiala.

[BibT_eX]

[DOI]

Nikhil Bansal

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.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Load Balancing: The Long Road from Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Approximation Results for Makespan Minimization with Budgeted Uncertainty.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jana Cslovjecsek

Friedrich Eisenbrand

Christoph Hunkenschröder

Robert Weismantel

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

Additive Approximation Schemes for Load Balancing Problems.

[BibT_eX]

[DOI]

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

The Submodular Santa Claus Problem in the Restricted Assignment Case.

[BibT_eX]

[DOI]

Paritosh Garg

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

Knapsack and Subset Sum with Small Items.

[BibT_eX]

[DOI]

Adam Polak

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

2020

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

[BibT_eX]

[DOI]

Alexandra Lassota

SIAM J. Discret. Math., 2020

A Quasi-Polynomial Approximation for the Restricted Assignment Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Paritosh Garg

CoRR, 2020

Learning Augmented Energy Minimization via Speed Scaling.

[BibT_eX]

[DOI]

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

Robust Algorithms Under Adversarial Injections.

[BibT_eX]

[DOI]

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

2019

Algorithms for Integer Programming and Allocation.

[BibT_eX]

[DOI]

PhD thesis, 2019

On Integer Programming and Convolution.

[BibT_eX]

[DOI]

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

Local Search Breaks 1.75 for Graph Balancing.

[BibT_eX]

[DOI]

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

2018

Compact LP Relaxations for Allocation Problems.

[BibT_eX]

[DOI]

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

2017

On the Configuration-LP of the Restricted Assignment Problem.

[BibT_eX]

[DOI]

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

Structured Instances of Restricted Assignment with Two Processing Times.

[BibT_eX]

[DOI]