Approximation algorithms for min-cost (S,T) connectivity
|Affiliation:||University of Waterloo|
|Room:||Mathematics & Computer Building (MC) 5158|
One of the well-known problems in network design is to find a minimum-cost strongly-connected spanning subgraph of a directed network. We study a natural generalization on directed networks called the min-cost (S,T) connectivity problem. The talk will introduce this and some related techniques.
200 University Avenue West
Waterloo, ON N2L 3G1