How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
In this paper, we propose the Widest k-set of Disjoint Paths Problem (WKDPP). Given a connected and capacitated digraph G = (V, A), the WKDPP consists in finding k arc-disjoint paths between two nodes s and t of V such that the sum of its minimum capacity arcs is maximized.