Loading Events

« All Events

  • This event has passed.

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

January 20 Wednesday @ 4:30 PM - 5:30 PM KST

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, which is known to be NP-hard. Since we need to care about global properties of graphs when we deal with additive t-spanners, Minimum Additive t-Spanner Problem is hard to handle, and hence only few results are known for it. In this talk, we study Minimum Additive t-Spanner Problem from the viewpoint of parameterized complexity. We formulate a parameterized version of the problem in which the number of removed edges is regarded as a parameter, and give a fixed-parameter algorithm for it. We also extend our result to (α,β)-spanners.


January 20 Wednesday
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:


Zoom ID: 934 3222 0374 (ibsdimag)


O-joung Kwon (권오정)
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.