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 Workplace
KTH is the largest technical university in Sweden. Education and research cover a broad spectrum within
natural sciences and engineering, as well as architecture, industrial engineering and management, urban planning, work science and environmental engineering. KTH has about 13000 full-time equivalent students of whom 7000 at Bachelor (first) level and 5500 at Master (second) level. In addition 1300 full-time equivalent students at doctoral studies (third) level and 3900 employees.
CSC is one of Sweden’s most advanced and successful research and education institutions in Information Technology situated at KTH and Stockholm University. The activities of the school focus on higher education and research within the traditional core areas of numerical analysis and computer science; from theory building and analysis of mathematical models to algorithm construction, implementation and simulation. Other core areas of growing importance are technology and methods for the support of human communication and computer mediated cooperation over distances in time and space. The applied research includes scientific computing, computer science, computer vision, robotics, neuroinformatics and neural networks, human-computer interaction, media technology and graphic arts, and communication through speech, language and music. For more information see: www.kth.se/csc , go to”CSC International Website”.
The Division of Theoretical Computer Science offers a strong research environment including 5 full professors and encompasses a wide spectrum of areas within the theoretical aspects of computer science.
Assignment
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 www.csc.kth.se/tcs/projects/approx.php .
Employment
Form of employment: One year positition that can be extended by one year.
Work time: Full-time.
Start date: According to agreement
Number of positions: 1
The position is mainly a research position, with a small fraction of departmental duties (e.g. teaching).
Qualifications
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.
Application
Application deadline: February 15, 2012
Employer’s reference number: D-2012-0016
Applications via email are to be sent to Suanne Bergman: susanneb@csc.kth.se
Write reference number in the email subject. (CV, etc should be sent as an attachment, preferably pdf-files.) Write reference number in the email subject.
We also accept hard copy applications sent to:
KTH, CSC
Att. Susanne Bergman,
Lindstedtsvägen 3, plan 4,
SE-100 44 Stockholm, Sweden
An application should include the following information/documents:
1. CV
2. Research Plan
3. Names of at least three references
We are currently gathering information to help improve our recruitment process. We would, therefore, be very grateful if you could include an answer to the following question within your application: Where did you initially come across this job advertisement?
Contact(s)
For enquiries about employment conditions please contact:
Eva-Lena Åkerman, HR Manager
Phone: +46 8 790 91 06
ela@csc.kth.se
For enquiries about the project please contact:
Johan Håstad, Professor
Phone: +46 8 790 6289
johanh@kth.se
Union representative
David Spangenberg, SACO
Phone: +46 8 790 9437
davidspa@kth.se
Niclas Carlsson, ST
Phone: +46 8 790 8416
nc@kth.se
Per-Ove Öster, LO/SEKO
Phone: +46 70 690 8382
perove@admin.kth.se
