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!

    Problem 9.1

    Greedy maximum matching
    This is a required question
    This is a required question

    Problem 9.2

    FPAS for routing under gas limitatino
    This is a required question
    This is a required question

    Problem 9.3

    Scheduling with precedence constraints
    This is a required question
    This is a required question

    Problem 9.4

    Approximation scheme for Bin Packing
    This is a required question
    This is a required question

    Problem 9.5

    Competitive ratio for river crossing
    This is a required question
    This is a required question
Request edit access