IEOR 6614, Spring 2016 : Homework 1

Assigned: Thursday, January 21, 2016
Due: Thursday, January 28, 2016

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 .

Problems

    1. List your previous degrees.
    2. Where did you take a course in algorithms.
    3. Have you had a course in linear programming? If so, briefly describe the course.
    4. Have you had a courses combinatorics, graph theory, and/or discrete mathematics? If so, briefly describe the course.
    5. Describe your computer programming experience.
  2. Problem 2.38. Adjacency matrices and strong connectivity.
  3. Problem 3.4. Function ranking.
  4. Work out the details of Baruvka's algorithm and show that it runs in O(m log n ) time.
  5. Problem 13.34. Balanced Spanning Trees.

  6. Switch to:

    cliff@ieor.columbia.edu