TY - CONF A1 - Schwartz, Stephan A1 - Borndörfer, Ralf A1 - Balestrieri, Leonardo T1 - On Finding Subpaths With High Demand T2 - Operations Research Proceedings 2017 N2 - We study the problem of finding subpaths with high demand in a given network that is traversed by several users. The demand of a subpath is the number of users who completely cover this subpath during their trip. Especially with large instances, an efficient algorithm for computing all subpaths' demands is necessary. We introduce a path-graph to prevent multiple generations of the same subpath and give a recursive approach to compute the demands of all subpaths. Our runtime analysis shows, that the presented approach compares very well against the theoretical minimum runtime. Y1 - 2018 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6927 SP - 355 EP - 360 PB - Springer International Publishing ER -