Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

ATSP constant approximation: great job, dj3500!

Revision en3, by Endagorion, 2017-09-11 23:42:22

A huge breakthrough in approximation algorithms was announced recently as asymmetric travelling salesman problem was shown to allow a constant approximation scheme. See discussion in an article by R.J. Lipton. One of the co-authors was Jakub dj3500 Tarnawski. It always pleases me to see competitive programmers achieving heights beyond CP, in academia and "real-life" problems (recall that OpenAI's bot recently beat human players at 1v1 Dota2, with meret and Psyho in the developers team). Congratulations on an outstanding achievement, Jakub!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Endagorion 2017-09-11 23:42:22 5 Tiny change: 'gh/). One was the co-au' -> 'gh/). One of the co-au'
en2 English Endagorion 2017-09-11 23:33:51 4 Tiny change: 'layers at Dota2, wi' -> 'layers at 1v1 Dota2, wi'
en1 English Endagorion 2017-09-11 23:32:50 708 Initial revision (published)