BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210120T163000
DTEND;TZID=Asia/Seoul:20210120T173000
DTSTAMP:20260423T011955
CREATED:20201211T084524Z
LAST-MODIFIED:20240707T081951Z
UID:3358-1611160200-1611163800@dimag.ibs.re.kr
SUMMARY:Yusuke Kobayashi (小林 佑輔)\, An FPT Algorithm for Minimum Additive Spanner Problem
DESCRIPTION: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.
URL:https://dimag.ibs.re.kr/event/2021-01-20/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR