Lecture

Optimization Algorithms: Greedy Approach

In course

Proident ipsum pariatur occaecat proident aliqua aliqua ut aute sunt amet ad. Cupidatat adipisicing dolore cillum dolor. Mollit officia reprehenderit et nostrud ullamco deserunt laboris dolore magna fugiat cupidatat ipsum veniam aliqua. Fugiat minim magna aliquip eu. Reprehenderit et elit laboris quis laboris irure ea dolore amet consequat incididunt magna labore. Proident aliquip consequat do dolor ut.

Description

This lecture covers optimization problems, greedy algorithms, and the Cashier's Algorithm for finding the least total number of coins for a given amount. It also includes proofs of optimality for the change-making algorithm using U.S. coins.

Official source

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

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

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

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.