Approximating The Optimum: Efficient Algorithms And Their Limits

2017 48:37
Synopsis
Most combinatorial optimization problems of interest are NP-hard to solve exactly. To cope with this intractability, one settles for ...
Download Options
Choose a download method below. All links open in new tabs.
Service Features Action
SaveFrom
MP4 & MP3 • HD Quality • Browser Extension Available
Download
Security Notice: These are third-party services. We recommend using antivirus software and being cautious of pop-up ads.