瑞典皇家理工学院招收博士后研究员

Postdoctoral position in NP-hard optimization problems : Stockholm, Sweden
Employer: KTH Royal Institute of Technology
Location: Stockholm, SWEDEN, Stockholm, Sweden
Type: Other
Posted: February 05, 2012
Expires: February 15, 2012
Requisition number: Euraxess-euraxess-jobs-33758357

job description

Applicants should have, or soon complete, a PhD degree in a subject relevant for the research, such as computer science, applied mathematics or mathematics. Solid knowledge of efficient computation in general and efficient approximability of NP-hard optimization problems in particular is a requirement.
Description

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 .