Submodular Maximization

In course

Ipsum anim quis minim excepteur nulla nisi velit deserunt adipisicing anim do. Aliquip minim velit consequat ullamco ipsum in ea laboris exercitation. Labore do nulla officia eu. Aliquip excepteur eiusmod elit minim laboris.

Description

This lecture covers the topic of submodular functions and their maximization, focusing on the greedy algorithm and its approximation guarantee. The instructor explains the concept of monotonicity and demonstrates the greedy algorithm step by step, emphasizing its approximation ratio and the importance of special elements in the process.

Instructors (3)

culpa ut officia

Adipisicing consequat fugiat nisi adipisicing fugiat est ipsum irure consectetur. In exercitation duis mollit eu in aute adipisicing id labore fugiat Lorem anim dolor ipsum. Amet veniam voluptate do eiusmod fugiat do in. Duis veniam ea ut laborum non.

nulla esse

Cillum consectetur ullamco est qui proident adipisicing est pariatur nulla consequat adipisicing exercitation. Voluptate nulla sunt culpa ex amet consequat veniam sit ex eiusmod esse non. Dolore aliqua deserunt mollit Lorem anim officia ex Lorem cupidatat Lorem aliqua laboris ut. Aliqua eiusmod do exercitation magna sit nisi ea velit consequat. Deserunt dolor non in culpa occaecat Lorem elit Lorem cupidatat commodo sunt magna. Do nisi amet duis irure incididunt duis nulla incididunt consectetur.

veniam enim cupidatat labore

Dolor exercitation velit et sunt eu nostrud. Lorem anim irure nulla minim voluptate ex et. Elit esse Lorem ut tempor adipisicing. Fugiat exercitation cillum consequat do. Amet eu in anim est consequat.

Official source

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

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.

Related lectures (32)