Request edit access
JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Problem Set 9 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!
Sign in to Google
to save your progress.
Learn more
* Indicates required question
Problem 9.1
Greedy maximum matching
*
easy
1
2
3
4
5
6
7
difficult
*
not useful
1
2
3
4
5
6
7
useful
Problem 9.2
FPAS for routing under gas limitatino
*
easy
1
2
3
4
5
6
7
difficult
*
not useful
1
2
3
4
5
6
7
useful
Problem 9.3
Scheduling with precedence constraints
*
easy
1
2
3
4
5
6
7
difficult
*
not useful
1
2
3
4
5
6
7
useful
Problem 9.4
Approximation scheme for Bin Packing
*
easy
1
2
3
4
5
6
7
difficult
*
not useful
1
2
3
4
5
6
7
useful
Problem 9.5
Competitive ratio for river crossing
*
easy
1
2
3
4
5
6
7
difficult
*
not useful
1
2
3
4
5
6
7
useful
Submit
Clear form
This content is neither created nor endorsed by Google. -
Terms of Service
-
Privacy Policy
Does this form look suspicious?
Report
Forms
Help and feedback
Contact form owner
Help Forms improve
Report
