Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 53-minute lecture on dynamic graph approximations, focusing on j-trees, presented by Gramoz Goranci from the University of Vienna. Delve into the powerful algorithmic paradigm of approximating graphs by j-trees, which has proven effective in accelerating cut-based optimization problems, approximate maximum flows, and exact minimum cost-flow computations. Learn about the dynamic maintenance of j-trees and understand the implications of this approach. Gain insights from the collaborative research conducted by Li Chen, Monika Henzinger, Richard Peng, and Thatchaphol Saranurak in this Simons Institute talk on Dynamic Graphs and Algorithm Design.
