New algorithms for maximum disjoint paths based on tree-likeness

Krzysztof Fleszar; Matthias Mnich; Joachim Spoerhase

doi:10.1007/s10107-017-1199-3

New algorithms for maximum disjoint paths based on tree-likeness

Krzysztof Fleszar^*, Matthias Mnich, Joachim Spoerhase

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Original language	English
Pages (from-to)	433-461
Number of pages	29
Journal	Mathematical Programming
Volume	171
Issue number	1-2
DOIs	https://doi.org/10.1007/s10107-017-1199-3
Publication status	Published - 1 Sep 2018

Keywords

Disjoint paths
Approximation algorithm
Feedback vertex set
Fixed-parameter algorithm
FLOW
INTEGER
THEOREM

Access to Document

10.1007/s10107-017-1199-3

Cite this

@article{588b52c06f9c4b01b412cf602ca3bab7,

title = "New algorithms for maximum disjoint paths based on tree-likeness",

keywords = "Disjoint paths, Approximation algorithm, Feedback vertex set, Fixed-parameter algorithm, FLOW, INTEGER, THEOREM",

author = "Krzysztof Fleszar and Matthias Mnich and Joachim Spoerhase",

year = "2018",

month = sep,

day = "1",

doi = "10.1007/s10107-017-1199-3",

language = "English",

volume = "171",

pages = "433--461",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer Verlag",

number = "1-2",

}

TY - JOUR

T1 - New algorithms for maximum disjoint paths based on tree-likeness

AU - Fleszar, Krzysztof

AU - Mnich, Matthias

AU - Spoerhase, Joachim

PY - 2018/9/1

Y1 - 2018/9/1

KW - Disjoint paths

KW - Approximation algorithm

KW - Feedback vertex set

KW - Fixed-parameter algorithm

KW - FLOW

KW - INTEGER

KW - THEOREM

U2 - 10.1007/s10107-017-1199-3

DO - 10.1007/s10107-017-1199-3

M3 - Article

C2 - 30956356

VL - 171

SP - 433

EP - 461

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-2

ER -