Balanced interval coloring

DOI10.4230/LIPICS.STACS.2011.531MaRDI QIDQ3113717zbMATH OpenFDO

Authors Antonios Foivos Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza

Publication date 23 January 2012

Full work available at URL https://arxiv.org/abs/1012.3932, http://subs.emis.de/LIPIcs/frontdoor_8664.html

zbMATH Keywords

discrepancy theoryload balancingNP-hardness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• scientific article; zbMATH DE number 1759407
• On the \(k\)-coloring of intervals
• Online Capacitated Interval Coloring
• scientific article; zbMATH DE number 2086378
• Online capacitated interval coloring

This page was built for publication: Balanced interval coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113717)