文献
J-GLOBAL ID:202202217092518956
整理番号:22A0857864
有向Steiner経路カバーの計算【JST・京大機械翻訳】
Computing directed Steiner path covers
著者 (5件):
Gurski Frank
(Institute of Computer Science, Heinrich Heine University Duesseldorf, Duesseldorf, Germany)
,
Komander Dominique
(Institute of Computer Science, Heinrich Heine University Duesseldorf, Duesseldorf, Germany)
,
Rehs Carolin
(Institute of Computer Science, Heinrich Heine University Duesseldorf, Duesseldorf, Germany)
,
Rethmann Jochen
(Faculty of Electrical Engineering and Computer Science, Niederrhein University of Applied Sciences, Krefeld, Germany)
,
Wanke Egon
(Institute of Computer Science, Heinrich Heine University Duesseldorf, Duesseldorf, Germany)
資料名:
Journal of Combinatorial Optimization
(Journal of Combinatorial Optimization)
巻:
43
号:
2
ページ:
402-431
発行年:
2022年
JST資料番号:
W1143A
ISSN:
1382-6905
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
ドイツ (DEU)
言語:
英語 (EN)