{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article8600","name":"On Routing Disjoint Paths in Bounded Treewidth Graphs","abstract":"We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph G and a collection of k source-destination pairs M = (s_1, t_1), ..., (s_k, t_k). The goal is to maximize the number of pairs that can be routed subject to the capacities in the graph. A routing of a subset M' of the pairs is a collection P of paths such that, for each pair (s_i, t_i) in M', there is a path in P connecting s_i to t_i. In the Maximum Edge Disjoint Paths (MaxEDP) problem, the graph G has capacities cap(e) on the edges and a routing P is feasible if each edge e is in at most cap(e) of the paths of P. The Maximum Node Disjoint Paths (MaxNDP) problem is the node-capacitated counterpart of MaxEDP.\r\n\r\nIn this paper we obtain an O(r^3) approximation for MaxEDP on graphs of treewidth at most r and a matching approximation for MaxNDP on graphs of pathwidth at most r. Our results build on and significantly improve the work by Chekuri et al. [ICALP 2013] who obtained an O(r * 3^r) approximation for MaxEDP.","keywords":["Algorithms and data structures","disjoint paths","treewidth"],"author":[{"@type":"Person","name":"Ene, Alina","givenName":"Alina","familyName":"Ene"},{"@type":"Person","name":"Mnich, Matthias","givenName":"Matthias","familyName":"Mnich"},{"@type":"Person","name":"Pilipczuk, Marcin","givenName":"Marcin","familyName":"Pilipczuk"},{"@type":"Person","name":"Risteski, Andrej","givenName":"Andrej","familyName":"Risteski"}],"position":15,"pageStart":"15:1","pageEnd":"15:15","dateCreated":"2016-06-22","datePublished":"2016-06-22","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ene, Alina","givenName":"Alina","familyName":"Ene"},{"@type":"Person","name":"Mnich, Matthias","givenName":"Matthias","familyName":"Mnich"},{"@type":"Person","name":"Pilipczuk, Marcin","givenName":"Marcin","familyName":"Pilipczuk"},{"@type":"Person","name":"Risteski, Andrej","givenName":"Andrej","familyName":"Risteski"}],"copyrightYear":"2016","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2016.15","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/arxiv.org\/abs\/1303.4897","isPartOf":{"@type":"PublicationVolume","@id":"#volume6256","volumeNumber":53,"name":"15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)","dateCreated":"2016-06-22","datePublished":"2016-06-22","editor":{"@type":"Person","name":"Pagh, Rasmus","givenName":"Rasmus","familyName":"Pagh"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article8600","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6256"}}}