Dynamic storage allocation and on-line colouring interval graphs
From MaRDI portal
Recommendations
Cited in
(8)- Variable sized online interval coloring with bandwidth
- A polynomial time approximation algorithm for dynamic storage allocation
- A new lower bound for the on-line coloring of intervals with bandwidth
- scientific article; zbMATH DE number 17824 (Why is no real title available?)
- On the Max Coloring Problem
- Approximation algorithms for round-UFP and round-SAP
- Single and multiple device DSA problems, complexities and online algorithms
- An improved algorithm for online coloring of intervals with bandwidth
This page was built for publication: Dynamic storage allocation and on-line colouring interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681192)