I have recently studied Thomas’ lecture notes on tree-decompositions on graphs, which gives the reader an insight into the concepts of tree-decomposition, tree-width etc. It had a understand-through-solving-problems approach that I believe is very nice and instructive:

http://people.math.gatech.edu/~thomas/PAP/treenotes.pdf

But the interesting part was that once I saw the problems of the 2nd assignment of approximation algorithms, I found that one of the optional problems is straightforward as the idea was covered in the notes. Specifically, problem 4(b) is easy if you study paragraphs C5-C9 of the notes.

### Like this:

Like Loading...

*Related*

Tags: approximation algorithms, Graph Theory, homework

This entry was posted on January 20, 2010 at 3:51 pm and is filed under fact. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

## Leave a Reply