Approximating the Non-contiguous Multiple Organization Packing Problem
From MaRDI portal
Publication:3163893
DOI10.1007/978-3-642-15240-5_23zbMath1198.68102OpenAlexW105073673MaRDI QIDQ3163893
Christina Otte, Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen
Publication date: 27 October 2010
Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15240-5_23
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (6)
Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Peak demand minimization via sliced strip packing ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ Improved approximation algorithms for scheduling parallel jobs on identical clusters
This page was built for publication: Approximating the Non-contiguous Multiple Organization Packing Problem
