Tutte seminar - Joseph Cheriyan
Approximation algorithms for min-cost (S,T) connectivity
Speaker: | Joseph Cheriyan |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
Abstract:
One of the well-known problems in network design is to find a minimum-cost strongly-connected spanning subgraph of a directed network.