CO 453 Network DesignCombinatorics and Optimization (2009-2010)
Network design under constraints on cost, capacity, distance and reliability. Approximation algorithms. The set covering problem. Tree solutions: spanning trees, Steiner trees, Gomory-Hu trees, optimum communication spanning trees. Connectivity, survivability and reliability. Network design with concentrators: the terminal layout problem. Location problems on networks.
Prerequisites: (MATH 239 or 249 and either CO 350 or CO 352/CM 340) or CO 355; Not open to General Mathematics students
Sections For Fall 2009
CO 453 is not held in Fall 2009
Sections For Spring 2009
CO 453 is not held in Spring 2009