Crossmark

New algorithms for maximum disjoint paths based on tree-likeness

Crossref DOI link: https://doi.org/10.1007/s10107-017-1199-3

Published Online: 2017-11-14

Published Print: 2018-09

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Fleszar, Krzysztof https://orcid.org/0000-0002-1129-3289
Mnich, Matthias https://orcid.org/0000-0002-4721-5354
Spoerhase, Joachim https://orcid.org/0000-0002-2601-6452
Funding

Funding for this research was provided by:

ERC (Starting Grant 306465)

Conicyt (PII20150140)

Millenium Nucleus (Information and Coordination in Networks RC130003)
License Information

License valid from 2017-11-14