Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.

Oscar H. Ibarra, Chul E. Kim: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. J. ACM 22(4): 463-468(1975)

@article{DBLP:journals/jacm/IbarraK75,
  author    = {Oscar H. Ibarra and
               Chul E. Kim},
  title     = {Fast Approximation Algorithms for the Knapsack and Sum of Subset
               Problems},
  journal   = {J. ACM},
  volume    = {22},
  number    = {4},
  year      = {1975},
  pages     = {463-468},
  ee        = {db/journals/jacm/IbarraK75.html, http://doi.acm.org/10.1145/321906.321909},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Chris Olston, Jennifer Widom: Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data. VLDB 2000: 144-155
Minos N. Garofalakis, Banu Özden, Abraham Silberschatz: On Periodic Resource scheduling for Continuous-Media Databases. VLDB J. 7(4): 206-225(1998)
Shlomo Moran: On the Complexity of Designing Optimal Partial-Match Retrieval Systems. ACM Trans. Database Syst. 8(4): 543-551(1983)

BibTeX