@InProceedings{ibrahimpur_et_al:LIPIcs.ICALP.2021.81,
  author =	{Ibrahimpur, Sharat and Swamy, Chaitanya},
  title =	{{Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan}},
  booktitle =	{48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
  pages =	{81:1--81:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-195-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{198},
  editor =	{Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.81},
  URN =		{urn:nbn:de:0030-drops-141504},
  doi =		{10.4230/LIPIcs.ICALP.2021.81},
  annote =	{Keywords: Approximation algorithms, Load balancing, Minimum-norm optimization, LP rounding}
}