I would like to advertise an open postdoc position on my ERC starting grant "Finding Cracks in the Wall of NP-completeness". The project aims to improve classical algorithms for NP-hard problems. For example: Can the Bellman-Held-Karp dynamic programming algorithm from the 1960's that solves TSP with n cities in 2^n time be improved to 1.9999^n time?
For more information on the position or the project please see
https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs/postdoc-position-in-algorithmic-theory-10-fte
or my website
https://webspace.science.uu.nl/~neder003/
The duration of the position is negotiable and for a maximum of 2.5 years. The application deadline is April 4th.
Thank you in advance for forwarding this to potential candidates!
Cheers,
Jesper Nederlof
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
