Solving the Steiner Tree Problem in Graphs Using the Key-Path Based Neighborhood with the kth Shortest Path

Solving the Steiner Tree Problem in Graphs Using the Key-Path Based Neighborhood with the kth Shortest Path
复制标题

使用基于关键路径的邻域和第 k 个最短路径解决图中的 Steiner 树问题

DOI：
--
复制
发表时间：
2018
期刊：
Proceedings of the 2018 International Symposium on Nonlinear Theory and its Applications (NOLTA2018)
影响因子：
--
通讯作者：
Misa Fujita，Takayuki Kimura，Kantaro Fujiwara，Tohru Ikeguchi
Misa Fujita，Takayuki Kimura，Kantaro Fujiwara，Tohru Ikeguchi
中科院分区：
--
文献类型：
--
作者：
Akiyo Natsubori;Iku Tsustui-Kimura;Hiroshi Nishida;Youcef Bouchekioua;Hiroshi Sekiya;Motokazu Uchigashima;Masahiko Watanabe;Alban de Kerchove d'Exaerde;Masaru Mimura;Norio Takata;and Kenji Tanaka;Misa Fujita，Takayuki Kimura，Kantaro Fujiwara，Tohru Ikeguchi

文献摘要

相似文献