Lesson 24: Network Algorithms and Approximations by Mohammad Hajiaghayi:Steiner Tree (Peyman Jabbar)

Mohammad Hajiaghayi · 86:00

The video surveys six NP-hard generalizations of the minimum spanning tree (MST): Steiner tree, Steiner forest, prize-collecting Steiner forest (PCSF), prize-collecting Steiner tree (PCST), k-MST and k-Steiner tree. M...

Read the full summary on tuber

Redirecting...