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. Prereq: MATH 229 or 239 or 249 and (One of CO 227, 250/350, 255/355, CO 352/CM 340); Not open to General Mathematics students
