[SOLVED] CS412 - HW2

Purpose
Background
For this assignment, you should
be able to recall and argue about the run-time complexity of algorithms be able to recall and apply the definition of a flow network
be able to recall and apply the Ford-Fulkerson method for finding maximum flow in a given flow network be able to apply dynamic programming in order to devise a solution to appropriate problems be able to apply greedy techniques in order to devise a solution to appropriate problems be comfortable with mathematical notation and structures, e.g. graphs, typically expected of a CS junior, be able to read semi-technical articles in order to extract the desired information be able to identify the algorithmic problem corresponding to a given problem be comfortable with the usual tools, e.g. GitHub, LaTeX, typically expected of a CS junior.
Task and Submission
Grading
The score earned by your submission will be assigned to the team assuming that the buddies contributed equally. To confirm, teams will be occasionally called in for a viva on their submission. If any of the members is unable to explain the submission or does not appear for the scheduled viva, the team will lose marks for the homework. You are encouraged to report non-contributing buddies through the appropriate form.
For discussion on the HW, please use the related Canvas discussion thread. viel Spass!