scientific article; zbMATH DE number 2086936

MaRDI QIDQ4737541zbMATH OpenFDO

Authors Gruia Calinescu, Amit Chakrabarti, Yuval Rabani, Howard Karloff

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370401.htm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• An improved approximation algorithm for \textsc{Resource Allocation}
• Improved algorithm for resource allocation problems
• Resource allocation with time intervals
• A unified approach to approximating resource allocation and scheduling
• scientific article; zbMATH DE number 4149886

Cited in

(34)

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

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)