We study a number of retrieval problems that relate to effectively using the throughput of parallel disks. These problems can be formulated as assigning a maximum number of jobs to machines of capacity two, where jobs are of size one or two that must satisfy assignment restrictions. We prove that the LP-relaxation of an integer programming formulation is half-integral, and derive an interesting persistency property. In addition, we derive 2/3-approximation results for two types of retrieval problems. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Aerts, J., Korst, J., & Spieksma, F. (2003). Approximation of a retrieval problem for parallel disks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2653, 178–188. https://doi.org/10.1007/3-540-44849-7_23
Mendeley helps you to discover research relevant for your work.