Date
Thu, 04 Oct 2007
Time
14:00 - 15:00
Location
Comlab
Speaker
Prof Etienne de Klerk
Organisation
Tilburg University

We consider the computational complexity of optimizing various classes

of continuous functions over a simplex, hypercube or sphere. These

relatively simple optimization problems arise naturally from diverse

applications. We review known approximation results as well as negative

(inapproximability) results from the recent literature.

Please contact us with feedback and comments about this page. Last updated on 03 Apr 2022 01:32.