This document contains comprehensive notes from Lecture 7 of the CO2412 course on Computational Thinking. The lecture explores two important strategies for solving optimization problems: Greedy Algorithms and the Branch and Bound method. It provides an in-depth understanding of how these approaches...
The Greedy Algorithm
1. Introduction
o A greedy algorithm follows the problem-solving heuristic of making
the locally optimal choice at each stage with the hope of finding the
global optimum.
o Greedy algorithms are typically used for optimization problems.
2. Characteristics of Greedy Algorithms
o Local Optimization: The algorithm selects the best option
available at each step without considering the broader context.
o Greedy Choice Property: It assumes that by choosing the optimal
local solution, the global solution will also be optimal.
o Optimal Substructure: The problem can be broken down into
smaller subproblems, which can be solved optimally.
Fractional Knapsack Problem
1. Problem Statement
o The Fractional Knapsack problem involves a thief who can carry a
maximum weight in their knapsack. The goal is to maximize the
value of the knapsack by taking fractions of items.
2. Greedy Approach to Fractional Knapsack
o Items are selected based on the highest value-to-weight ratio.
o The item with the highest ratio is taken first, followed by the next,
and so on, until the knapsack is full.
Example:
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller BpoBpo. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $4.68. You're not tied to anything after your purchase.
