{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lec19_GreedyAlgorithms

# Lec19_GreedyAlgorithms - Greedy Algorithms The Greedy...

This preview shows pages 1–7. Sign up to view the full content.

Greedy Algorithms

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
The Greedy Technique(Method) The greedy technique Problems explored The coin changing problem Activity selection
Optimization problems An optimization problem: Given a problem instance, a set of constraints and an objective function . Find a feasible solution for the given instance for which the objective function has an optimal value either maximum or minimum depending on the problem being solved. A feasible solution satisfies the problem’s constraints The constraints specify the limitations on the required solutions. For example in the knapsack problem we require that the items in the knapsack will not exceed a given weight

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
The Greedy Technique(Method) Greedy algorithms make good local choices in the hope that they result in an optimal solution. They result in feasible solutions. Not necessarily an optimal solution. A proof is needed to show that the algorithm finds an optimal solution. A counter example shows that the greedy algorithm does not provide an optimal solution.
Pseudo-code for Greedy Algorithm set Greedy (Set Candidate){ solution= new Set( ); while (Candidate.isNotEmpty()) { next = Candidate.select(); //use selection criteria, //remove from Candidate and return value if (solution.isFeasible( next)) //constraints satisfied solution.union( next); if (solution.solves()) return solution} //No more candidates and no solution return null }

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Pseudo code for greedy cont.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern