Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 2/2]
Tim Roughgarden Lectures · 14:08
The lecture drops the single-channel assumption from the FCC incentive-auction greedy method and shows that checking whether another station can stay on the air becomes K-coloring of the interference graph—NP-hard for...