# EE 607 Advanced Network Algorithms Spring 2005

Under construction

• Syllabus (pdf)
• Lectures:  MWF 1:30-2:20, Holmes 389
• InstructorGalen Sasaki
• Email: sasaki@spectra.eng.hawaii.edu
• Office:  Holmes 436 (or Holmes 485).  Office Hours:  MWF 2:30-3:20
• Tel: 956 6103
Announcements
• Midterm Exam: April 8 (friday)
• Oral Presentations of Final Projects May 11 Wed
• Time:  130-430
• Room:  Holmes 389
• Lectures
• Projects
• Homeworks
• Homework 1 [Due Jan. 31, 2005]
• 2.1-2 (pg 21, 1 pt)
• 2.1-3 (pg, 1 pt)
• 2.2-2 (pg 27, 2pts)
• 2.3-2 (pg 36, 2 pts)
• 2.3-3 (pg 36, 1 pt)
• 2-2 (pg 38, 4 pts)
• 2.3-7 (pg 37, 1 pt, for extra credit)
• Homework 2 [Due Feb 11, 2005 friday]
• 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)
• Homework 4 [Due Feb 23, 2005 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)
• Homework 6 [Due, March 28, 2005 mon]
• 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)