Skip to content

SpringNuance/Approximation-Algorithms

Repository files navigation

Approximation-Algorithms

About

The course covers techniques for designing efficient algorithms that find near-optimal solutions to NP-hard problems, including 𝑘 k-approximation, graph algorithms, greedy methods, LP rounding, and combinatorial optimization

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages