Pages that link to "Item:Q4595477"
From MaRDI portal
The following pages link to Approximation algorithms for dynamic storage allocation (Q4595477):
Displaying 11 items.
- Single and multiple device DSA problems, complexities and online algorithms (Q764370) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← 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)
- 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)
