A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- D.S. Hirschberg
- C.K. Wong
- 1976
- Journal of the ACM
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
5 results for D.S. Hirschberg
Computing Connected Components on Parallel Computers
- D.S. Hirschberg
- A.K. Chandra
- et al.
- 1979
- CACM
Faster construction of optimal binary split trees
- J.H Hester
- D.S Hirschberg
- et al.
- 1986
- Journal of Algorithms
Upper and lower bounds for graph-diameter problems with application to record allocation
- D.S Hirschberg
- C.K Wong
- 1979
- Journal of Combinatorial Theory, Series B
Approximate algorithms for some generalized knapsack problems
- Ashok K. Chandra
- D.S. Hirschberg
- et al.
- 1976
- Theoretical Computer Science