Pages that link to "Item:Q1024215"

The following pages link to Resource allocation in bounded degree trees (Q1024215):

Displaying 10 items.

• Cost allocation in asymmetric trees (Q296616) (← links)
• Constant-competitive tree node assignment (Q391778) (← links)
• A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
• Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
• Flexible resource allocation to interval jobs (Q1999968) (← links)
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions (Q2032152) (← links)
• Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
• On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
• Minimax Resource Allocation with Tree Structured Substitutable Resources (Q3352858) (← links)
• A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)