Yusuke Kobayashi gave an online talk on his algorithm for finding a large subgraph keeping the distance function differs by at most a constant at the Virtual Discrete Math Colloquium

On January 20, 2021, Yusuke Kobayashi (小林 佑輔) from RIMS, Kyoto University gave an online talk at the Virtual Discrete Math Colloquium on the fixed-parameter tractability of the problem of finding a small set X of edges such that for every pair v, w of vertices the distance from v to w in G is at most a constant plus the distance from v to w in G-X. The title of his talk was “An FPT Algorithm for Minimum Additive Spanner Problem“.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.