1 Search Results for "Hueffner, Falk"


Document
Balanced Interval Coloring

Authors: Antonios Antoniadis, Falk Hueffner, Pascal Lenzner, Carsten Moldenhauer, and Alexander Souza

Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)


Abstract
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two colors is minimal. Somewhat surprisingly, a coloring with maximal difference at most one always exists. Furthermore, we give an algorithm with running time O(n log n + kn log k) for its construction. This is in particular interesting because many known results for discrepancy problems are non-constructive. This problem naturally models a load balancing scenario, where $n$~tasks with given start- and endtimes have to be distributed among $k$~servers. Our results imply that this can be done ideally balanced. When generalizing to $d$-dimensional boxes (instead of intervals), a solution with difference at most one is not always possible. We show that for any d >= 2 and any k >= 2 it is NP-complete to decide if such a solution exists, which implies also NP-hardness of the respective minimization problem. In an online scenario, where intervals arrive over time and the color has to be decided upon arrival, the maximal difference in the size of color classes can become arbitrarily high for any online algorithm.

Cite as

Antonios Antoniadis, Falk Hueffner, Pascal Lenzner, Carsten Moldenhauer, and Alexander Souza. Balanced Interval Coloring. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 531-542, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{antoniadis_et_al:LIPIcs.STACS.2011.531,
  author =	{Antoniadis, Antonios and Hueffner, Falk and Lenzner, Pascal and Moldenhauer, Carsten and Souza, Alexander},
  title =	{{Balanced Interval Coloring}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
  pages =	{531--542},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Schwentick, Thomas and D\"{u}rr, Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.531},
  URN =		{urn:nbn:de:0030-drops-30413},
  doi =		{10.4230/LIPIcs.STACS.2011.531},
  annote =	{Keywords: Load balancing, discrepancy theory, NP-hardness}
}
  • Refine by Author
  • 1 Antoniadis, Antonios
  • 1 Hueffner, Falk
  • 1 Lenzner, Pascal
  • 1 Moldenhauer, Carsten
  • 1 Souza, Alexander

  • Refine by Classification

  • Refine by Keyword
  • 1 Load balancing
  • 1 NP-hardness
  • 1 discrepancy theory

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2011

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail