Abstract
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺p on N. Each item has a size and an associated weight. The objective is to pack a set N’⊆ N of maximum weight in a knapsack of bounded size. N’ should be precedence-closed, i.e., be a valid prefix of ≺p . POK is a natural generalization, for which very little is known, of the classical Knapsack problem. In this paper we advance the state-of-the-art for the problem through both positive and negative results. We give an FPTAS for the important case of a 2-dimensional partial order, a class of partial orders which is a substantial generalization of the series-parallel class, and we identify the first non-trivial special case for which a polynomial-time algorithm exists. We also characterize cases where the natural linear relaxation for POK is useful for approximation and we demonstrate its limitations. Our results have implications for approximation algorithms for scheduling precedence-constrained jobs on a single machine to minimize the sum of weighted completion times, a problem closely related to POK.
Research partially supported by NSERC Grant 227809-00
Research partially supported by NSERC Grant OG0001798
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Brandstädt, V.B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM, Philadelphia, PA, 1999.
R.D. Carr, L.K. Fleischer, V. J. Leung, and C.A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.
C. Chekuri and R. Motwani. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics, 98:29–38, 1999.
F.A. Chudak and D. S. Hochbaum. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters, 25:199–204, 1999.
F.A. Chudak and D.B. Shmoys. Approximation algorithms for precedenceconstrained scheduling problems on parallel machines that run at different speeds. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, 581–590, 1997.
B. Dushnik and E.W. Miller. Partially ordered sets. Amer. J. Math., 63:600–610, 1941.
U. Feige. Relations between average case complexity and approximation complexity. In Proc. 34th ACM Symposium on Theory of Computing, 534–543, 2002.
U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29:410–421, 2001.
M.X. Goemans and D.P. Williamson. Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM J. on Discrete Mathematics, 13:281–294, 2000. Preliminary version in Proc. SODA 1999.
L. A. Hall, A. S. Schulz, D.B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res., 22:513–544, 1997.
D. S. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-hard problems, 94–143. PWS, 1997.
O.H. Ibarra and C. E. Kim. Fast approximation algorithms for the Knapsack and sum of subset problems. J. ACM, 22:463–468, 1975.
D. S. Johnson and K.A. Niemi. On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res., 8(1):1–14, 1983.
T. Kloks and D. Kratsch. Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. IPL, 55:11–16, 1995.
F. Margot, M. Queyranne, and Y. Wang. Decompositions, network flows and a precedence-constrained single machine scheduling problem. TR 2000-29, Dept. of Mathematics, University of Kentucky, Lexington. Communicated in 1997.
R.H. Möhring. Computationally tractable classes of ordered sets. In I. Rival, editor, Algorithms and Order, 105–194. Kluwer, Boston, MA, 1989.
R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM J. Computing, 6:973–989, 1987.
P. Schuurman and G. J. Woeginger. Polynomial time approximation algorithms for machine scheduling: ten open problems. J. of Scheduling, 2:203–213, 1999.
J. B. Sidney. Decomposition algorithms for single machine sequencing with precedence relations and deferral costs. Operations Research, 23:283–298, 1975.
W. T. Trotter. Combinatorics of Partially Ordered Sets. Johns Hopkins University Press, Baltimore, Md., 1992.
G. J. Woeginger. On the approximability of average completion time scheduling under precedence constraints. In Proc. 28th ICALP, 887–897, 2001.
M. Yannakakis. On the complexity of partial order dimension problem. SIAM J. Alg. Discr. Methods, 3:351–358, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolliopoulos, S.G., Steiner, G. (2002). Partially-Ordered Knapsack and Applications to Scheduling. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_54
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive