Algorithm Design

This repo contains my homeworks for Algorithm Design course by professor S. Leonardi

Homework 1

• K centers permutation
• Vertex cover in bipartite graphs
• NP complete problem reduction (K-Clique)
• Hiring process with dynamic programming
• MST with a fixed edge

Homework 2

• one more NP complete problem
• Set cover with redundancies (Randomized rounding)
• Multiway cut
• Minimum string cover (Lineaer Programming)
• Zero sum game and MNE
• Random walk