Presentation 2021-03-05
Polynomial-time Algorithm for Case of Constant Number of Edges with Unrestricted Cost in Problem of Determining Weight of Edges for Reduction of Diameter
Kaito Miyanagi, Hiroyoshi Miwa,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English)
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # NS2020-155
Date of Issue 2021-02-25 (NS)

Conference Information
Committee IN / NS
Conference Date 2021/3/4(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Online
Topics (in Japanese) (See Japanese page)
Topics (in English) General
Chair Kenji Ishida(Hiroshima City Univ.) / Akihiro Nakao(Univ. of Tokyo)
Vice Chair Kunio Hato(Internet Multifeed) / Tetsuya Oishi(NTT)
Secretary Kunio Hato(Hiroshima City Univ.) / Tetsuya Oishi(KDDI Research)
Assistant / Shinya Kawano(NTT)

Paper Information
Registration To Technical Committee on Information Networks / Technical Committee on Network Systems
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Polynomial-time Algorithm for Case of Constant Number of Edges with Unrestricted Cost in Problem of Determining Weight of Edges for Reduction of Diameter
Sub Title (in English)
Keyword(1)
1st Author's Name Kaito Miyanagi
1st Author's Affiliation Kwansei Gakuin University(Kwansei Gakuin Univ.)
2nd Author's Name Hiroyoshi Miwa
2nd Author's Affiliation Kwansei Gakuin University(Kwansei Gakuin Univ.)
Date 2021-03-05
Paper # NS2020-155
Volume (vol) vol.120
Number (no) NS-413
Page pp.pp.191-196(NS),
#Pages 6
Date of Issue 2021-02-25 (NS)