Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1153.68555OpenAlexW2494705596MaRDI QIDQ5492866

Leah Epstein, Meital Levy

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

zbMATH Keywords

online algorithmsbin packinginterval coloring

Mathematics Subject Classification ID

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)

Related Items (3)

A new lower bound for the on-line coloring of intervals with bandwidth ⋮ Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints ⋮ Variable sized online interval coloring with bandwidth

This page was built for publication: Mathematical Foundations of Computer Science 2005