@InProceedings{berndt_et_al:LIPIcs.ISAAC.2023.13,
author = {Berndt, Sebastian and Brinkop, Hauke and Jansen, Klaus and Mnich, Matthias and Stamm, Tobias},
title = {{New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.13},
URN = {urn:nbn:de:0030-drops-193155},
doi = {10.4230/LIPIcs.ISAAC.2023.13},
annote = {Keywords: Integer programming, scheduling algorithms, uniformly related machines, makespan minimization}
}