Status Updates From Algorithm Design

Dios no más porfavor ya entendí no más

Finally got rid of this elephant. Even though, I completely got lost in the chapter 11, 12, the author mercifully brought me back to the well known and applicable algorithms in the last chapter. Now I'm a little more hopeful in my future explorations

Sometimes you eat an elephant by small chunks. Sometimes you swallow the last two legs and hope that next time you eat your stomach already know how to process the oversized dish

I'm completely lost in the last 3-4 chapters. However, with the theoretical explanations in this book and some practices, I was now able to solve some intermediate dynamic programming problems all by myself

I can't believe I just read an entire book with >800 pages of algorithms analysis. Now I need a coffee.

I'm on Chapter 11: Approximative algorithms. Previous chapters covered NP-SPACE problems, properties of Tree decomposition in graphs.
- Maximum Independent Set with Greedy Algorithms
- Maximum Weight Independent Set of Tree with dynamic programming algorithm
-Circular arc-coloring problem
In Chapter 11:
read how greedy algorithms can go badly in the Load Balancing Problem and also in the Center Selection Prob.