NP Complete Approximation Algorithm
Along with 2 other students, placed 2/250 in an upper division CS class competition. (CS 170). We experimented with greedy, DP, LP, parallelization, simulated annealing, and other techniques to approximate a problem resembling set cover. We used Rust, AWS, GCP, and Python to build our solution.