IEOR 6614, Spring 2011 : Homework 3

Assigned: Thursday, February 3, 2011
Due: Thursday, February 10, 2011

General Instructions

  1. Please review the course information.
  2. You must write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.
  3. Numbered problems are all from the textbook Network Flows .


  1. Problem 4.6. Cluster Analysis.
  2. Problem 4.34, Problem 4.36. K-shortest paths.
  3. Given a directed acyclic graph G, with source c let ct(v) be the number of distinct paths from s to v. Give an efficient algorithm to compute ct(v) for all vertices v.
  4. Problem 5.51, 5.52. Bit-scaling for shortest paths
  5. Problem 5.16. Updating shortest paths.

Switch to: