Pages that link to "Item:Q4651485"
From MaRDI portal
The following pages link to <i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation (Q4651485):
Displaying 17 items.
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Flexible resource allocation to interval jobs (Q1999968) (← links)
- Profit maximization in flex-grid all-optical networks (Q2300629) (← 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)
- Profit Maximization in Flex-Grid All-Optical Networks (Q2868649) (← links)
- On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- An Improved Upper Bound for the Ring Loading Problem (Q5071092) (← links)
- Optimizing active ranges for consistent dynamic map labeling (Q5902232) (← links)
