Algorithms for NP-Hard Problems: Greedy Heuristics in the FCC Incentive Auction (Part 2 of 2)
This section discusses the optimization challenges of the FCC Incentive Auction and explores greedy heuristic methods for addressing these NP-hard problems, as presented in Algorithms Illuminated.
Tim Roughgarden Lectures
589 views • Jun 12, 2020
About this video
The optimization problem underlying the FCC Incentive Auction, and greedy heuristic approaches to solving it.
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Video Information
Views
589
Likes
4
Duration
14:08
Published
Jun 12, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now