On Finding Subpaths With High Demand

Stephan Schwartz (), Leonardo Balestrieri and Ralf Borndörfer ()
Additional contact information
Stephan Schwartz: Zuse Institute Berlin
Leonardo Balestrieri: Zuse Institute Berlin
Ralf Borndörfer: Zuse Institute Berlin

A chapter in Operations Research Proceedings 2017, 2018, pp 355-360 from Springer

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

Keywords: Recursive Approach; User Trajectories; Mining Frequent Substructures; Longest Subpath; Problem-specific Construction (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_48

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_48

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().