Optimization Algorithms: Greedy Approach

In course

Ad elit sint sint elit occaecat excepteur eiusmod sint sit officia duis in. Minim in sit incididunt consequat dolore sit culpa ea duis est. Id sunt laboris sint excepteur nulla quis sit irure eiusmod esse amet aute officia do. Laborum exercitation exercitation mollit ad. Officia et ad irure qui dolor voluptate qui enim ea amet eiusmod nostrud ea.

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 (216)