Computer Science and Engineering Design and Analysis of Algorithms Virtual Lab Experiments

Greedy Algorithms 2: Fractional Knapsack Problem

Book References

  1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,
    Introduction to Algorithms, 3rd Edition, MIT Press, 2009.

    • Chapter 16: Greedy Algorithms (Section 16.2 – The Fractional Knapsack Problem)

  2. Ellis Horowitz, Sartaj Sahni, and Sanguthevar Rajasekaran,
    Fundamentals of Computer Algorithms, 2nd Edition, Universities Press, 2007.

    • Chapter 4: Greedy Method (Knapsack Problem)

  3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,
    The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    • Chapter 4: Greedy Algorithms (Knapsack Problem)

Website References

  1. MIT OpenCourseWare – Greedy Algorithms
    https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/pages/lecture-notes/

  2. NPTEL – Design and Analysis of Algorithms (IIT Bombay, Prof. Abhiram Ranade)

  3. NPTEL – Data Structures and Algorithms Design (IIT Kanpur, Prof. Nitin Saxena)