Parameterized Complexity Dichotomy for Steiner Multicut

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

doi:10.1016/j.jcss.2016.03.003

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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

No external resources are shared

Fulltext (restricted access)

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

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

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

Abstract

There is no abstract available