CO 453Network Design
- Faculty
- Mathematics
- Last listed
- Spring 2020
No longer offered. It was in Waterloo’s course catalog since at least Winter 2020 (as far back as Open Data goes) to Spring 2020. It isn’t in the 2024–25 or later calendars.
In the course catalog from Winter 2020 to Spring 2020; Open Data has no classes for it in that time.
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.
Requirements, as last listed
Prereq: MATH 229 or 239 or 249 and (one of CO 227, 250, 255, 352)
Discussed on r/uwaterloo
One post or comment in 1 thread mentions CO 453, April 2016 to December 2024. Quoted word for word, newest first; each reply sits under the post and the comment that started its branch. Search r/uwaterloo for newer posts.
Winter 2016
Geomatics to now be offered under the math faculty for 2016-17, students in the Geomatics in the environment faculty can transfer given few prerequisites 105 points, 19 comments
u/Huex3: “… Project (1.0 unit) Two additional courses chosen from CO 370 Deterministic OR Models CO 453 Network Design STAT 440 Computational Inference STAT 441 Statistical Learning - Classification STAT 442 Data Visualization STAT 444 Statistical Learning - Function Estimation Five …”
Check it elsewhere
- Undergraduate Calendar, 2019–20Its last calendar entry, on ucalendar
- Course outlinesSyllabi from past terms (UW login)
- UW FlowStudent ratings and reviews
- WClassesPast sections back to 2004, and who taught them
In the scanned calendars
How it read in each calendar from 1993–94 to 1994–95, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1993–94 to 1994–95 2 calendars
Network design under constraints on cost, capacity, distance and reliability. Tree solutions: spanning trees, Steiner trees, optimum communication spanning trees. Connectivity, survivability and reliability. Network design with concentrators: the terminal layout problem. Geometric network design: the plane and the sphere. Location problems on networks. Algorithmic aspects.
Prereq: C&O 350. C&O 351 is recommended.
Offered Fall · 3 class hours a week · 0.5 credit