Recent News for an Old Steiner Tree Formulation
|Affiliation:||University of Waterloo|
|Room:||Mathematics and Computer Building (MC) 5158|
The Steiner tree problem is a fundamental network design problem where the goal is to compute a minimum-cost tree spanning a collection of terminals in a given input graph. In this talk we will report on some recent progress for several variants of the problem that stems from new insights into an old directed formulation for optimal branchings due to Edmonds.
200 University Avenue West
Waterloo, ON N2L 3G1