# EE 607 Advanced Network Algorithms Spring 2006

Under construction

• Syllabus (pdf)
• Lectures:  MWF 12:30-1:20, Holmes 389
• InstructorGalen Sasaki
• Email: sasaki@spectra.eng.hawaii.edu
• Office:  Holmes 484.  Office Hours:  MWF 1:30-2:20
• Tel: 956 7586
Announcements
• Projects.
• Homeworks.
• Hw 2 [Due Feb 1, wed], seven problems for Cormen et al:  2.1-2 (pg 21, 1pt);  2.1-3 (1 pt);  2.2-2 (pg 27, 2pts); 2.3-2 (pg 36, 2pts); 2.3-3 (pg 36, 1 pt); 2-2 ( pg 38, 4 pts); 2.3-7 (pg 37, 1 pt for extra credit).
• Hw 3 [Due Feb 20, mon],eight problems: B.4-1 (pg 1084, 1 pt); B.5-3 (pg 1091, 1 pt); B-1 (a,b,c,d) (pg 1091-1092, 4 pts); B-2 (a,b) (pg 1092, 2 pts); 22.1-1 (pg 530, 1 pt); 22.1-6 (pg 530, 2 pt this is tricky); 22.2-2 (pg 538, 1 pt); 22.2-6 (pg 539, 2 pts)
• Hw 4 [Due March 15,wed].  Problem 24.1-3 (page 591, 1 pt); Problem 24.3-2 (page 600, 2 pts); Problem 24.3-3 (page 600, 2 pts); Problem 24.3-4 (page 600, 2 pts, Note that a path <v0, v1, ...., vn> has reliability r(v0,v1) x r(v1,v2) x ... x r(vn-1,vn));  Problem 24-1 (a) (page 614, 2 pts. Don't do part (b)); Problem 24-3 (a) (page 615, 2 pts. Don't do part (b)); Problem 26.1-7 (p. 650, 1 pt);  Problem 26.2-6 (p. 663, 1 pt)
• Hw 5 [Due April 7, friday] Six problems, and two of the problems have multiple parts:  Problem 23.1-2 (1 pt); Problem 23.2-4 (1 pt); Problem 23-1 (a,b,c) (1 pt/part), note that part (d) is not included; Problem 23-3 (a,b) (1 pt/part); Problem 34.5-5 (2 pts); Problem 34.5-6 (2 pts).
• Exams
• Midterm Exam:  April 17 Monday.  Coverage:  Homeworks 1 through 4, and Lectures up to and including Maxflow algorithms.  You are allowed 1 page of notes (back and front).
• Final Exam:  May 12, Friday 12noon-2pm Holmes Hall 389.  You are allowed two sheets of notes (back and front), the textbook and a calculator.