Assigned:
Thursday, March 1, 2012
Due:
Thursday, March 8, 2012
General Instructions
- Please review the
course information.
- 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.
- Numbered problems are all from the textbook Network Flows .
Problems
- Problem 7.14. An example of the push/relabel algorithm.
- Suppose that we have a flow network, but we know that each
edge capacity is an integer of value at most k. Analyze runnning time
of the generic push/relabel algorithm in terms of n, m and k.
- Problem 7.20. (The highest-label algorithm applies discharge to the
active vertex with the highest distance label.)
- Analyze the FIFO algorithm given in class using the potential function
Σv (2d(v) | e(v) > 0). You do not need to obtain the O(n3) bound, just obtain a polynomial bound.
Switch to:
[email protected]