Sciweavers

Share
APPML
2006

Threshold arrangements and the knapsack problem

8 years 7 months ago
Threshold arrangements and the knapsack problem
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs, threshold arrangements, and other well-studied combinatorial objects, and we correct an error in the analysis given in that paper.
Günter Rote, André Schulz
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where APPML
Authors Günter Rote, André Schulz
Comments (0)
books