Slacker News Slacker News logo featuring a lazy sloth with a folded newspaper hat
  • top
  • new
  • show
  • ask
  • jobs
Library
← Back to context

Comment by 7scan

11 hours ago

You're basically describing the classical fully polynomial-time approximation scheme for 0-1 knapsack. I think it first appeared in the 1979 paper "Fast approximation algorithms for knapsack problems" by Eugene L Lawler.

0 comments

7scan

Reply

No comments yet

Contribute on Hacker News ↗

Slacker News

Product

  • API Reference
  • Hacker News RSS
  • Source on GitHub

Community

  • Support Ukraine
  • Equal Justice Initiative
  • GiveWell Charities