• DOI:10.1145/800057.808701
Corpus ID: 14305007

On finding the exact solution of a zero-one knapsack problem

@inproceedings{Goldberg1984OnFT,
  title={On finding the exact solution of a zero-one knapsack problem},
  author={A. Goldberg and A. Marchetti-Spaccamela},
  booktitle={STOC '84},
  year={1984}
}

• A. Goldberg, A. Marchetti-Spaccamela
• Published in STOC '84 1984
• Mathematics, Computer Science

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed

Given a 0-1 knapsack problem with input drawn from a certain probability distribution, we show that for every ε > 0, there is a self-checking polynomial-time algorithm that finds an optimal solution with probability at least 1 -ε. We also prove some upper and lower bounds on random variables related to the problem.