Pages that link to "Item:Q1176726"
From MaRDI portal
The following pages link to A polynomial time approximation algorithm for dynamic storage allocation (Q1176726):
Displaying 15 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)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← 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)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- Optimal on-line coloring of circular arc graphs (Q4858840) (← links)
- An Improved Upper Bound for the Ring Loading Problem (Q5071092) (← links)
- Dynamic storage allocation with known durations (Q5918029) (← links)
- An approximation result for a periodic allocation problem (Q5946816) (← links)
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades (Q6554626) (← links)
