Bincoloring

DOI10.1016/j.tcs.2008.05.022zbMath1154.68565OpenAlexW4213289215MaRDI QIDQ954994

Sven O. Krumke, Leen Stougie, Willem E. de Paepe, Jörg Rambau

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.022

zbMATH Keywords

competitive analysisNP-hardness

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (6)

A theoretical comparison of LRU and LRU-K ⋮ Selfish bin coloring ⋮ Relative Worst-Order Analysis: A Survey ⋮ Comparing online algorithms for bin packing problems ⋮ List factoring and relative worst order analysis ⋮ Selfish colorful bin packing games

Cites Work

• Unnamed Item
• Unnamed Item
• Speed is as powerful as clairvoyance
• Algorithms and Computation
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Bincoloring