scientific article; zbMATH DE number 7758354

DOI10.4230/lipics.approx/random.2020.52arXiv1802.09503MaRDI QIDQ6084415

No author found.

Publication date: 31 October 2023

Full work available at URL: https://arxiv.org/abs/1802.09503

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloringonline algorithmsinterval graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Online coloring of short intervals

Cites Work

• Unnamed Item
• Unnamed Item
• First-fit coloring on interval graphs has performance ratio at least 5
• An improved algorithm for online coloring of intervals with bandwidth
• A note on first-fit coloring of interval graphs
• Lower bounds for on-line graph coloring
• Algorithmic graph theory and perfect graphs
• Representation of a finite graph by a set of intervals on the real line
• Classes of interval graphs under expanding length restrictions
• On some packing problem related to dynamic storage allocation
• Parallel and On-Line Graph Coloring
• Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs
• Automata, Languages and Programming

This page was built for publication: