The previous lesson formalised NP-completeness; this closing lesson of the entire unit makes it concrete with a short tour of named NP-complete problems relevant to a quant practitioner's likely encounters, then covers the honest, practical response once a problem is recognised as (likely) NP-hard: approximation algorithms with provable performance guarantees, as the disciplined alternative to either giving up or naively brute-forcing an exponential search.
In this lesson
- Learning objectives
- A short tour of named NP-complete problems
- Approximation algorithms
- The full decision process
- Closing the unit
Before you start
The full lesson, with worked examples and exercise solutions, is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or explore the curriculum.