So what's next after CLRS?I've stumbled across this book and have learned a lot of stuff but I find many of the proofs really incomprehensible and I end up searching proofs elsewhere. Should I just push through or is there a better option?
You can try using Cook
>>15151029>after CLRSalgorithms spreads out very widely to the point where there are few books covering a single type. The closest is maybe Erik Demaine's advanced algorithms course on MIT OCW. But some topics are >randomized/sublinear algorithms>sketching algorithms>geometric algorithms>spectral methods and Laplacians>analytic combinatorics (aka advanced analysis of algorithms)>quantum algorithms >distributed algorithms>cache oblivious algorithms>algebraic algorithms (i.e. those for computing group/ring/field properties efficiently)>algorithms for topological data analysis (related to the above)and so on.
Check out proof based (linear) algebra, graph theory, Theory of computation,... books to build a better intuition. Then revisit the book
>>15153174Try reading Rudin's book on the topic
Two nice books:Randomized Algorithms - Rajeev Motwani, Prabhakar RaghavanProbability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis 2nd Edition- Michael Mitzenmacher, Eli Upfal
>>15153174OP clearly states that they want to learn combinatorial optimization but they are having difficulty with Korte and Vygen. The answer isn't to ask them to clarify what they want to learn.>>15151029You could use Cook, that's a good suggestion.There's also the copy of the 1st course in Combinatorial Opt by Goemans at MIT which has a bibliography, PSets and notes: https://math.mit.edu/~goemans/18433S15/18433.html