Seminar within Theory Pearls: "Sampling in Large Matrices and Approximation of CSP" M. Karpinski, Bonn Univ.

Date: October 06, 2008 (Monday) at 13:15 to 15:00

Sampling in Large Matrices and
Approximation of CSP"


Marek Karpinski
Univ. of Bonn



Abstract. We survey some recent results in designing
constant time approximation schemes (CTASs) for large
classes of NP-hard optimization problems. We describe
underlying randomized approximation methods and new
paradigms for designing such algorithms and put them
in more general perspective.

Room: LTH, E:2405

Last modified Dec 9, 2011 12:59 pm

0235