Problem Set 6 Survey
Please help us evaluate the difficulty and usefulness of the problems in this problem set. Participation in this survey is voluntary and anonymous. Thank you!
Problem 6.1
Student/faculty meetings
easy
difficult
not useful
useful
Problem 6.2
Does shortest augmenting path find min-cost max-flows?
easy
difficult
not useful
useful
Problem 6.3
Convert non-integral min-cost flows to integral ones
easy
difficult
not useful
useful
Problem 6.4
Prefrosh host matching
easy
difficult
not useful
useful
Problem 6.5
Scaling algorithm for min-cost flow
easy
difficult
not useful
useful
Submit
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Additional Terms