|
|
Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT)
April 28, 2017 18:30–19:55, Dolgoprudniy, Institutsly per,9, Dolgoprudny, Moscow region,
conference hall 115 (building of applied mathematics)
|
 |
|
 |
|
|
|
Аппроксимируемость задачи маршрутизации и близких задач в классе детерминированных алгоритмов
M. Yu. Khachayab
a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
|
| Number of views: |
| This page: | 333 | | Materials: | 35 | | Youtube Live: | |
|
Supplementary materials:
lecture.pdf (1.9 Mb)
|
|
Contact us: