Endagorion's blog

By Endagorion, history, 9 days ago, In English,

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!

 
 
 
 
  • Vote: I like it  
  • +636
  • Vote: I do not like it  

»
8 days ago, # |
  Vote: I like it +20 Vote: I do not like it

There is a presentation going live about it .

»
8 days ago, # |
  Vote: I like it +78 Vote: I do not like it

Wow, thanks! Didn't expect to see such a post... I guess at ICPC you learn to pick a good three-person team!

The video of today's talk by Laszlo is here, for those who are interested.