Parameterized Complexity Dichotomy for Steiner Multicut

Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan

doi:10.1016/j.jcss.2016.03.003

アイテム詳細

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

一時保存へ追加

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

公開

学術論文

Parameterized Complexity Dichotomy for Steiner Multicut

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44612

Hermelin, Danny
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons136475

Mnich, Matthias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons98374

van Leeuwen, Erik Jan
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.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Bringmann, K., Hermelin, D., Mnich, M., & van Leeuwen, E. J. (2016). Parameterized Complexity Dichotomy for Steiner Multicut. Journal of Computer and System Sciences, 1020-1043. doi:10.1016/j.jcss.2016.03.003.

引用: https://hdl.handle.net/11858/00-001M-0000-002C-535A-7

要旨

要旨はありません