Join Zoom Meeting
https://zoom.us/j/98172222418?pwd=b0htSDQ5NDRKQ050K0d6cHJ3YnZXQT09
Meeting ID: 981 7222 2418
Password: studsem

Zoom Details:
Link: https://zoom.us/j/98172222418?pwd=b0htSDQ5NDRKQ050K0d6cHJ3YnZXQT09
Meeting ID: 981 7222 2418

Abstract: Given an edge weighted graph and a spanning tree, $T$, the {\em tree augmentation problem} is to pick a minimum weight set of edges, $F$, such that $T\cup F$ is 2-edge connected. Williamson et.al.

Abstract: Consider the following 2-respecting min-cut problem: Given a weighted graph G and its spanning tree T, find the minimum cut among the cuts that contain at most two edges in T.