Lecture

Optimization Algorithms: Greedy Approach

In course

Mollit consectetur et id reprehenderit cupidatat id. Adipisicing labore sunt pariatur aute consectetur. Exercitation est tempor ex adipisicing mollit qui occaecat laborum dolor ea aliquip. Esse proident nisi veniam sint tempor ut eu tempor magna irure nostrud.

Description

This lecture covers optimization problems and the application of greedy algorithms to find the 'best' choice at each step. Examples include finding the fastest route between cities and the Cashier's algorithm for minimizing the number of coins needed for change.

Official source

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

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: Analysis of algorithms

Mathematics

Algebra: Abstract algebra

Analysis: Topics in analysis

Logic

Classical logic: First-order logic

Related lectures (184)

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.