Online Capacitated Interval Coloring
DOI10.1007/978-3-540-74450-4_22zbMath1176.68237OpenAlexW2293820021MaRDI QIDQ5901463
Erlebach, Thomas, Asaf Levin, Leah Epstein
Publication date: 3 March 2009
Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_22
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Online Capacitated Interval Coloring
