CS 3510: Algorithms

Assignment 9

Assignment

Problems identified by x.y(z) denote the problem “y”, in chapter “x” of the textbook, with part “z”. If “z” is not noted, then the entire problem is required.

Assignment 9a

9.3 Branch-and-bound for set cover

Assignment 9b

9.7 (a,b) Approximation for multiway cut

Assignment 9c

9.5 Local search for minimum spanning tree

Submission

Submit you solutions by the due date and time. For written problems, your work and answers as a PDF to Canvas. For code, submit the source code to the class git repository. For tables and graphs, submit a PDF to Canvas.

Last Updated 01/09/2023