Approximate Algorithms for the 0/1 Knapsack Problem.

Sartaj Sahni: Approximate Algorithms for the 0/1 Knapsack Problem. J. ACM 22(1): 115-124(1975)

@article{DBLP:journals/jacm/Sahni75,
  author    = {Sartaj Sahni},
  title     = {Approximate Algorithms for the 0/1 Knapsack Problem},
  journal   = {J. ACM},
  volume    = {22},
  number    = {1},
  year      = {1975},
  pages     = {115-124},
  ee        = {db/journals/jacm/Sahni75.html, http://doi.acm.org/10.1145/321864.321873},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Minos N. Garofalakis, Banu Özden, Abraham Silberschatz: On Periodic Resource scheduling for Continuous-Media Databases. VLDB J. 7(4): 206-225(1998)
Minos N. Garofalakis, Banu Özden, Abraham Silberschatz: Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases. VLDB 1997: 516-525
Nick Roussopoulos: View Indexing in Relational Databases. ACM Trans. Database Syst. 7(2): 258-290(1982)

BibTeX