Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
From MaRDI portal
Publication:5450807
DOI10.1007/11671541_6zbMath1132.90379OpenAlexW158608945MaRDI QIDQ5450807
Publication date: 14 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671541_6
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)
Related Items (6)
APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS ⋮ A faster FPTAS for the unbounded knapsack problem ⋮ Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ An improved approximation scheme for variable-sized bin packing ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ New approximability results for two-dimensional bin packing
This page was built for publication: Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications