|
Friday, Sep 17, 2010 |
|
|
|
|
Approximation algorithms for min-cost (S,T) connectivity |
|
|
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. |