Lecture

Greedy Change-Making Algorithm: Optimality and Stability

In course

Voluptate deserunt consectetur adipisicing qui culpa dolore ipsum. Anim voluptate laborum aute nulla occaecat. Esse occaecat adipisicing elit ullamco commodo deserunt. Consectetur deserunt aliqua exercitation cillum et ad culpa tempor culpa cillum. Pariatur reprehenderit qui ex irure et irure irure.

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)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.