Bincoloring

DOI10.1016/J.TCS.2008.05.022zbMATH Open1154.68565OpenAlexW4213289215MaRDI QIDQ954994FDOQ954994

Authors: Sven O. Krumke, Willem E. De Paepe, Jörg Rambau, L. Stougie 

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

Recommendations

• scientific article; zbMATH DE number 1875408
• Class constrained bin packing revisited
• Colorful bin packing
• Online colored bin packing
• Colored bin packing: online algorithms and lower bounds

zbMATH Keywords

competitive analysisNP-hardness

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Speed is as powerful as clairvoyance
• Optimal time-critical scheduling via resource augmentation
• Algorithms and Computation
• Title not available (Why is that?)

Cited In (8)

• Selfish bin coloring
• Title not available (Why is that?)
• A theoretical comparison of LRU and LRU-K
• A tutorial on the use of graph coloring for some problems in robotics
• Relative Worst-Order Analysis: A Survey
• Selfish colorful bin packing games
• List factoring and relative worst order analysis
• Comparing online algorithms for bin packing problems

This page was built for publication: Bincoloring

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