New Algorithms for Maximum Disjoint Paths Based on Tree-likeness

Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim

doi:10.1007/s10107-017-1199-3

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2554144_5

DetailsSummary

Released

Journal Article

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

No external resources are shared

Fulltext (restricted access)

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

Fulltext (public)

s10107-017-1199-3.pdf
(Publisher version), 591KB

Supplementary Material (public)

There is no public supplementary material available

Citation

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

Cite as: https://hdl.handle.net/21.11116/0000-0000-B54C-F

Abstract

There is no abstract available