scientific article; zbMATH DE number 2086936
From MaRDI portal
Publication:4737541
Recommendations
Cited in
(34)- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
- scientific article; zbMATH DE number 4149886 (Why is no real title available?)
- Bandwidth allocation in cellular networks with multiple interferences
- Improved Approximation Algorithms for Budgeted Allocations
- Pricing on paths: a PTAS for the highway problem
- A fixed-parameter tractability result for multicommodity demand flow in trees
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
- A unified approach to approximating resource allocation and scheduling
- Improved algorithm for resource allocation problems
- Improved algorithms for resource allocation under varying capacity
- Using fractional primal-dual to schedule split intervals with demands
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
- A new approximation technique for resource-allocation problems
- Approximation algorithm for resource allocation problems with time dependent penalties
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- Online optimization of busy time on parallel machines. (Extended abstract)
- Improved algorithms for resource allocation under varying capacity
- Packing cars into narrow roads: PTASs for limited supply highway
- Resource allocation problem under single resource assignment
- The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
- Improving LTL truck load utilization on line
- New Approximation Results for Resource Replication Problems
- An improved approximation algorithm for \textsc{Resource Allocation}
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
- Scheduling Resources for Throughput Maximization
- Resource allocation with time intervals
- A constant factor approximation algorithm for the storage allocation problem
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- Optimal interval scheduling with a resource constraint
- Scheduling split intervals with non-uniform demands
- Resource allocation in bounded degree trees
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
- Optimizing busy time on parallel machines
- Online optimization of busy time on parallel machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737541)