论文信息 - Threshold arrangements and the knapsack problem

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 (2002) 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 | G. Rote | A. Schulz

[1] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[2] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.

[3] N. Mahadev,et al. Threshold graphs and related topics , 1995 .

[4] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[5] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[6] Kyriakos Kalorkoti. ALGEBRAIC COMPLEXITY THEORY (Grundlehren der Mathematischen Wissenschaften 315) , 1999 .

[7] Valentin E. Brimkov,et al. An alternative to Ben-Or's lower bound for the knapsack problem complexity , 2002, Appl. Math. Lett..

[8] Charalambos A. Charalambides,et al. Enumerative combinatorics , 2018, SIGA.

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10] David Connolly. Knapsack Problems: Algorithms and Computer Implementations , 1991 .

[11] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.

[12] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .