English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  New Algorithms for Maximum Disjoint Paths Based on Tree-likeness

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.

Item is

Files

show Files
hide Files
:
s10107-017-1199-3.pdf (Publisher version), 591KB
Name:
s10107-017-1199-3.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 Interna- tional License ( http://creativecommons.org/licenses/by/4.0/ ), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Locators

show

Creators

show
hide
 Creators:
Fleszar, Krzysztof1, Author           
Mnich, Matthias2, Author
Spoerhase, Joachim2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20172018
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: edge-disjoint-paths-mapr-17
DOI: 10.1007/s10107-017-1199-3
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Mathematical Programming / A
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Heidelberg : North-Holland
Pages: 29 p. Volume / Issue: 171 (1-2) Sequence Number: - Start / End Page: 433 - 461 Identifier: ISSN: 0025-5610
CoNE: https://pure.mpg.de/cone/journals/resource/954928560452