Title: Approximation of a retrieval problem for parallel disks
Authors: Aerts, J ×
Korst, J
Spieksma, Frederik #
Issue Date: 2003
Publisher: Springer-verlag berlin
Host Document: Algorithms and complexity, proceedings vol:2653 pages:178-188
Conference: CIAC 2003 : Italian conference on algorithms and complexity No5, Rome , ITALIE date:28-30 May 2003
Abstract: 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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science