Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Friday, September 17, 2010 — 3:30 PM to 4:30 PM EDT
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. 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.
Location
MC - Mathematics & Computer Building
5158
200 University Avenue West
Waterloo, ON N2L 3G1
Canada
200 University Avenue West
Waterloo, ON N2L 3G1
Canada