ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Unknown

On Finding Subpaths With High Demand (2018)

Schwartz, Stephan ; Borndörfer, Ralf ; Balestrieri, Leonardo

add to mindlist on the mindlist

Details

Publication Date: 2021-01-22

Description: 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.

Language: English

Type: conferenceobject , doc-type:conferenceObject

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

OPUS

Overview

hit 1 - 1 | 1 hit