a. Duality: Shortest essential cycle
b. Crosses shortest path at most once
c. Slicing into a shortest-path problem
d. Easy algorithms: Brute force and MSSP
e. Divide-and-conquer: O(n log k) time
f. High-level sketch of improvement to O(n log log k) time