Class Web Page | http://www.cs.utsa.edu/~korkmaz/teaching/cs6973 |
Time and Location |
MW 4:00 pm - 5:50 pm HSS 3.02.30 Jun 01, 2004 - Aug 06, 2004 |
Instructor |
Dr. Turgay Korkmaz
Office: SB 3.02.01B Email: korkmaz@cs.utsa.edu Phone: (210) 458-7346 Fax: (210) 458-4437 |
Office Hours | MW 3:00-4:00pm (or by appointment) |
Prerequisite | Programming experience, algorithms (CS5633 or equivalent) |
Textbook |
Required:
Optional:
|
Objectives | Many real-life problems, particularly computer networking problems, are formulated and solved using network (or graph) structures and algorithms. The objective of this course is to provide knowledge and skills to students so that they can comfortably use network structures and algorithms in their research or workplace. |
Course Topics |
CHAPTER 1. INTRODUCTION CHAPTER 2. PATHS, TREES AND CYCLES CHAPTER 3. ALGORITHM DESIGN AND ANALYSIS CHAPTER 4. SHORTEST PATHS: LABEL SETTING ALGORITHMS CHAPTER 5. SHORTEST PATHS: LABEL CORRECTING ALGORITHMS CHAPTER 6. MAXIMUM FLOWS : BASIC IDEAS CHAPTER 7. MAXIMUM FLOWS : POLYNOMIAL ALGORITHMS CHAPTER 9. MINIMUM COST FLOWS : BASIC ALGORITHMS CHAPTER 10. MINIMUM COST FLOWS : POLYNOMIAL ALGORITHMS CHAPTER 16. LAGRANGIAN RELAXATION AND NETWORK OPTIMIZATION CHAPTER 17. MULTICOMMODITY FLOWS
If time permits, some of the followings CHAPTER 12. ASSIGNMENTS AND MATCHINGS CHAPTER 13. MINIMUM SPANNING TREES CHAPTER 14. CONVEX COST FLOWS CHAPTER 15. GENERALIZED FLOWS
|
Grading |
Make-up examinations will be given if you have an officially acceptable excuse. |
Assignments |
|
Class Notes |
|
Assigned readings | |
Other online materials |