### Yusuke Kobayashi (小林 佑輔), An FPT Algorithm for Minimum Additive Spanner Problem

Zoom ID: 934 3222 0374 (ibsdimag)For a positive integer t and a graph G, an additive t-spanner of G is a spanning subgraph in which the distance between every pair of vertices is at most the original distance plus t. Minimum Additive t-Spanner Problem is to find an additive t-spanner with the minimum number of edges in a given graph, …