Knapsack Problems

Martello, S., & Toth, P. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley.

Type

Book chapter

Intellectual base

Textbook

Year

1990

ISBN

9780471924203

Link

https://openlibrary.org/books/OL1859139Mmatched

Cited by

1 citation across 1 artifact.

Domain-specific

• Pseudo-polynomial transformation
  • These clauses let a polynomially bounded NP-complete restriction of the source map to a polynomially bounded restriction of the target, which is the step needed to transfer strong NP-hardness.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:719dd53df4b0 · see in the full table