Vector assignment schemes for asymmetric settings
From MaRDI portal
Publication:2491210
DOI10.1007/s00236-005-0003-7zbMath1089.68025MaRDI QIDQ2491210
Publication date: 26 May 2006
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-005-0003-7
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Cites Work
- A 13/12 approximation algorithm for bin packing with extendable bins
- Approximation schemes for scheduling on parallel machines
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Vector assignment problems: a general framework
- Bounds for Certain Multiprocessing Anomalies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item