KTH School of Computer Science and Communication (CSC) announces a post-doctoral position with a focus on the approximability of NP-hard optimization problems.
The goal of the current project is to show mathematical theorems relating to efficient computation. The project studies NP-hard combinatorial optimization problems of central importance and aims to establish theoretical bounds on how well each problem can be approximated in polynomial time. The goal is to prove upper bounds by designing and analyzing algorithms and to prove lower bounds in the form of hardness results. A more detailed description of the project can be found at
http://www.csc.kth.se/tcs/projects/approx.php
Scholarship Application Deadline: 15 February 2011
Speak Your Mind