Polynomial-time
Approximation
Schemes for Euclidean TSP and other Geometric
Problems.Sanjeev
Arora.Journal
of the
ACM 45(5) 753-782, 1998..
[Postscript
of journal version].
(This paper
is based upon two
conference paper. The [
first ] in IEEE
FOCS 1996
pp
2--13 and the [second ]
in IEEE FOCS 1997. If you wish
to impelement this
algorithm, I suggest
testing trying it on the TSPLIB
database. )

Polynomial Time
Approximation
Schemes for dense instances of graph problems. Sanjeev
Arora,
David Karger, and Marek Karpinski. ACM
Symposium on
Theory of Computing,
1995. Final version
in Journal of
Computer and System Sciences.
[ postscript ]

Lecture plan and notes from a
grad
course
in Advanced Algorithms.
(Fall 2005) My stab at how to teach grad
algorithms so as to prepare
students
for research in this every-broadening field. See
also the 2006
and 2008
offerings.