Status Updates From Algorithm Design
Algorithm Design by
Status Updates Showing 211-240 of 241
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
Add a comment
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
Add a comment
- 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.









