Bley, AndreasNeto, Jose2021-12-172021-12-1720092197-8085https://depositonce.tu-berlin.de/handle/11303/15657http://dx.doi.org/10.14279/depositonce-14430A path is said to be l-bounded if it contains at most l edges. We consider two types of l-bounded disjoint paths problems. In the maximum edge- or node-disjoint path problems MEDP(l) and MNDP(l), the task is to find the maximum number of edge- or node-disjoint l-bounded (s,t)-paths in a given graph G with source s and sink t, respectively. In the weighted edge- or node-disjoint path problems WEDP(l) and WNDP(l), we are also given an integer k and non-negative edge weights, and seek for a minimum weight subgraph of G that contains k edge- or node-disjoint l-bounded (s,t)-paths. Both problems are of great practical relevance in the planning of fault-tolerant communication networks, for example.en510 Mathematikgraph algorithmslength-bounded pathscomplexityapproximation algorithmsResearch Paper