New Algorithms for Maximum Disjoint Paths Based on Tree-likeness

Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim

doi:10.1007/s10107-017-1199-3

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

New Algorithms for Maximum Disjoint Paths Based on Tree-likeness

MPS-Authors

/persons/resource/persons216986

Fleszar, Krzysztof
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

s10107-017-1199-3.pdf
(出版社版), 591KB

付随資料 (公開)

There is no public supplementary material available

引用

Fleszar, K., Mnich, M., & Spoerhase, J. (2018). New Algorithms for Maximum Disjoint Paths Based on Tree-likeness. Mathematical Programming / A, 171(1-2), 433-461. doi:10.1007/s10107-017-1199-3.

引用: https://hdl.handle.net/21.11116/0000-0000-B54C-F

要旨

要旨はありません