%0 Journal Article %1 Fleszar2018 %A Fleszar, Krzysztof %A Mnich, Matthias %A Spoerhase, Joachim %D 2018 %J Mathematical Programming %K approximability disjoint edge fl-info1 graph myown path routing tree %N 1-2 %P 433--461 %R 10.1007/s10107-017-1199-3 %T New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness %U https://doi.org/10.1007/s10107-017-1199-3 %V 171

@article{Fleszar2018, added-at = {2017-11-15T17:03:48.000+0100}, author = {Fleszar, Krzysztof and Mnich, Matthias and Spoerhase, Joachim}, biburl = {https://www.bibsonomy.org/bibtex/249765514d42e9ddabe5034371040c421/jspoerhase}, day = 14, doi = {10.1007/s10107-017-1199-3}, interhash = {ac6547f727a6e11345e6c4d2d6a01092}, intrahash = {49765514d42e9ddabe5034371040c421}, issn = {1436-4646}, journal = {Mathematical Programming}, keywords = {approximability disjoint edge fl-info1 graph myown path routing tree}, month = nov, number = {1-2}, pages = {433--461}, timestamp = {2023-11-17T19:03:43.000+0100}, title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness}, url = {https://doi.org/10.1007/s10107-017-1199-3}, volume = 171, year = 2018 }