Assigned:
Wednesday, October 3, 2001
Due:
Wednesday, October 10, 2001
General Instructions
- 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.
- Please do not express an algorithm using only pseudocode.
Additional explanation is required!
- Numbered problems are all from the textbook Network Flows .
Problems
- Problem 6.32. Airline scheduling.
- Problem 7.11 a, b, c. Converting a preflow to a flow.
- Problem 7.12. Critical arcs
- Problem 7.14. An example of the generic push/relabel algorithm.
- Show that a maximum flow can always be computed by a series of at
most m augmenting paths. Explain why this does not immediately yield
an O(m2) time algorithm for maximum flow.
Switch to:
[email protected]