scientific article; zbMATH DE number 2086936
From MaRDI portal
Publication:4737541
zbMATH Open1049.90035MaRDI QIDQ4737541FDOQ4737541
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
Title of this publication is not available (Why is that?)
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)
Cited In (34)
- Improved algorithms for resource allocation under varying capacity
- Scheduling split intervals with non-uniform demands
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
- A unified approach to approximating resource allocation and scheduling
- Using fractional primal-dual to schedule split intervals with demands
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
- Improved Approximation Algorithms for Budgeted Allocations
- Improved algorithms for resource allocation under varying capacity
- Resource allocation problem under single resource assignment
- Scheduling Resources for Throughput Maximization
- Title not available (Why is that?)
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
- 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
- Approximation algorithm for resource allocation problems with time dependent penalties
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
- 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)
- Title not available (Why is that?)
- Improved algorithm for resource allocation problems
- A new approximation technique for resource-allocation problems
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- New Approximation Results for Resource Replication Problems
- 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)
