Seeking independent study materials for approximation algorithms

From: Daubechies4 (nospam_at_please.ca)
Date: 12/17/04 

Date: Fri, 17 Dec 2004 17:14:09 -0500

I'm hoping to start a Ph.D. in approximation algorithms next Fall, but
I've been away from computer science for a while (did a M.A. in math,
and an M.Sc. in applied math after my B.Sc. in computer science).

Unfortunately, I know almost nothing about combinatorics, optimization,
combinatorial optimization, and operations research. I don't know how
important this is for studying approximation algorithms, but it seems
like it may be a bit of stumbling block for me.

I've been studying from Vijay Vazirani's book, "Approximation
Algorithms." The exercises are good, but I really like to have
solutions handy to verify my answers, see alternative solutions, and to
get hints about how to start when I'm stuck.

Does anyone know of a good book or web site that provides both exercises
and solutions for early study of approximation algorithms (or a related
field on which it depends)? Specifically, I'm fascinated by the PCP
theorem.

Thanks in advance!

Relevant Pages