Online Capacitated Interval Coloring

DOI10.1007/978-3-540-74450-4_22MaRDI QIDQ5901463zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Thomas Erlebach, Asaf Levin

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Online capacitated interval coloring
• Variable sized online interval coloring with bandwidth
• Variable Sized Online Interval Coloring with Bandwidth
• Approximation and Online Algorithms
• Online interval coloring with packing constraints

Cited in

(9)

• Variable sized online interval coloring with bandwidth
• Online coloring co-interval graphs
• Online conflict-free coloring for intervals
• Balanced interval coloring
• Variable Sized Online Interval Coloring with Bandwidth
• Approximation and Online Algorithms
• Online capacitated interval coloring
• Complexity and online algorithms for minimum skyline coloring of intervals
• scientific article; zbMATH DE number 7758354 (Why is no real title available?)

This page was built for publication: Online Capacitated Interval Coloring

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