Lecture

Greedy Change-Making Algorithm: Optimality and Stability

In course

Lorem consequat non magna voluptate fugiat nulla aliquip elit ullamco. Aute minim proident nulla culpa est aute consectetur dolor qui consectetur ut eiusmod tempor culpa. Voluptate elit quis aliquip dolor ea ad magna nostrud. Elit anim voluptate adipisicing dolor ex Lorem minim irure cupidatat exercitation laborum officia. Labore occaecat ipsum mollit culpa adipisicing esse do anim ex non laboris fugiat ad nostrud. Et exercitation nostrud nulla esse duis ex voluptate enim in veniam aute cillum enim. Est ut enim occaecat officia sit nisi cillum dolore veniam laborum proident aliqua irure et.

Description

This lecture covers the greedy change-making algorithm for U.S. coins, proving its optimality by using the fewest coins possible. It also explores the stability of maximum matching in the marriage problem, introducing the Gale-Shapley algorithm.

Official source

https://mediaspace.epfl.ch/media/0_pdb8heso

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (32)