IEOR 6614, Spring 2006 : Homework 03

Assigned: Thursday, February 2, 2006
Due: Wednesday, February 8, 2006

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 13.14. Tree minimax result.
  2. Problem 13.30. Most vital arcs.
  3. Problem 13.34. Balanced Spanning Trees.
  4. Prove or disprove the following statement. Let G=(V,E) be a graph with non-negative edge weights w, and let T be the minimum spanning tree. Let H be a graph formed from G by doubling each of the edge weights. T is a minimum spanning tree of H.
  5. Consider the case where the edge weights are all integers in the range 1 to 10. Explain how to implement Prim's algorithm so that it runs in linear time.

Switch to: