The following pages link to (Q4252337):
Displaying 4 items.
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
