Rafael’s Reviews > Algorithm Design > Status Update
Rafael
is 75% done
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.
— Mar 02, 2013 04:14AM
- 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.
1 like · Like flag
Rafael’s Previous Updates
Rafael
is finished
I can't believe I just read an entire book with >800 pages of algorithms analysis. Now I need a coffee.
— Apr 14, 2013 08:10AM
Rafael
is reading
I'm on Chapter 8 about NP and NP-complete problems and computational intractability.
Learned some reductions for NP and NP-complete problems like SAT, SAT-3, Vertex cover, Independent set and so on...
Practice with exercises for reductions and proof of its NP-completeness
— Feb 04, 2013 07:24AM
Learned some reductions for NP and NP-complete problems like SAT, SAT-3, Vertex cover, Independent set and so on...
Practice with exercises for reductions and proof of its NP-completeness
