@InProceedings{li_et_al:LIPIcs.ESA.2020.69,
author = {Li, Lily and Nikolov, Aleksandar},
title = {{On the Computational Complexity of Linear Discrepancy}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {69:1--69:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.69},
URN = {urn:nbn:de:0030-drops-129352},
doi = {10.4230/LIPIcs.ESA.2020.69},
annote = {Keywords: discrepancy theory, linear discrepancy, rounding, NP-hardness}
}