EDHR is a tunable generalization of Dembo-Hammer reduction that bounds how many near-break items an optimal 0-1 knapsack solution can omit or include.
Knapsack Problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
EDHR is a tunable generalization of Dembo-Hammer reduction that bounds how many near-break items an optimal 0-1 knapsack solution can omit or include.