Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900931
DOI10.1007/b11961zbMath1279.68361OpenAlexW4298253479MaRDI QIDQ5900931
Publication date: 26 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11961
Related Items (7)
Data migration on parallel disks: Algorithms and evaluation ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ Approximation schemes for deal splitting and covering integer programs with multiplicity constraints ⋮ Minimal cost reconfiguration of data placement in a storage area network ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Algorithms for storage allocation based on client preferences ⋮ A note on dual approximation algorithms for class constrained bin packing problems
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
