Pages that link to "Item:Q1176726"
From MaRDI portal
The following pages link to A polynomial time approximation algorithm for dynamic storage allocation (Q1176726):
Displayed 8 items.
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Single and multiple device DSA problems, complexities and online algorithms (Q764370) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- Coloring interval graphs with First-Fit (Q1898342) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- Optimal on-line coloring of circular arc graphs (Q4858840) (← links)
- Dynamic storage allocation with known durations (Q5918029) (← links)
- An approximation result for a periodic allocation problem (Q5946816) (← links)