Efficient computation of optimal temporal walks under waiting-time constraints

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

ISSN: 2364-8228

Extent: Online-Ressource

Language: Englisch

Notes: online resource.

Bibliographic citation: Efficient computation of optimal temporal walks under waiting-time constraints ; volume:5 ; number:1 ; day:6 ; month:10 ; year:2020 ; pages:1-26 ; date:12.2020
Applied network science ; 5, Heft 1 (6.10.2020), 1-26, 12.2020

Creator: Bentert, Matthias
Himmel, Anne-Sophie
Nichterlein, André
Niedermeier, Rolf

Contributor: SpringerLink (Online service)

DOI: 10.1007/s41109-020-00311-0

URN: urn:nbn:de:101:1-2020112216423010230672

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:27 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Bentert, Matthias
Himmel, Anne-Sophie
Nichterlein, André
Niedermeier, Rolf
SpringerLink (Online service)

Other Objects (12)

Finding Temporal Paths Under Waiting Time Constraints

Eulerian Walks in Temporal Graphs

Feature Enhanced Spatial–Temporal Trajectory Similarity Computation

Dynamics of temporal experience in active and passive waiting situations

Function computation under privacy, secrecy, distortion, and communication constraints

Pragmatic constraints on (adverbial) (temporal) quantification

The effect of waiting environment and perceived atmosphere on temporal experience

Preprint

Computation of solutions to dynamic models with occasionally binding constraints

Arbeitspapier

Efficient solution and computation of models with occasionally binding constraints

Exploiting strict constraints in the computation of cylindrical algebraic coverings

Efficient solution and computation of models with occasionally binding constraints

Finding Temporal Paths Under Waiting Time Constraints

Eulerian Walks in Temporal Graphs

Feature Enhanced Spatial–Temporal Trajectory Similarity Computation

Dynamics of temporal experience in active and passive waiting situations

Function computation under privacy, secrecy, distortion, and communication constraints

Pragmatic constraints on (adverbial) (temporal) quantification

The effect of waiting environment and perceived atmosphere on temporal experience

Preprint

Computation of solutions to dynamic models with occasionally binding constraints

Arbeitspapier

Efficient solution and computation of models with occasionally binding constraints

Exploiting strict constraints in the computation of cylindrical algebraic coverings

Efficient solution and computation of models with occasionally binding constraints

Finding Temporal Paths Under Waiting Time Constraints

Eulerian Walks in Temporal Graphs

Feature Enhanced Spatial–Temporal Trajectory Similarity Computation

Dynamics of temporal experience in active and passive waiting situations

Function computation under privacy, secrecy, distortion, and communication constraints

Pragmatic constraints on (adverbial) (temporal) quantification

The effect of waiting environment and perceived atmosphere on temporal experience

Preprint

Computation of solutions to dynamic models with occasionally binding constraints

Arbeitspapier

Efficient solution and computation of models with occasionally binding constraints

Exploiting strict constraints in the computation of cylindrical algebraic coverings

Efficient solution and computation of models with occasionally binding constraints

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Efficient computation of optimal temporal walks under waiting-time constraints

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

Finding Temporal Paths Under Waiting Time Constraints

Eulerian Walks in Temporal Graphs

Feature Enhanced Spatial–Temporal Trajectory Similarity Computation

Dynamics of temporal experience in active and passive waiting situations

Dynamics of temporal experience in active and passive waiting situations

Function computation under privacy, secrecy, distortion, and communication constraints

Pragmatic constraints on (adverbial) (temporal) quantification

The effect of waiting environment and perceived atmosphere on temporal experience

Computation of solutions to dynamic models with occasionally binding constraints

Efficient solution and computation of models with occasionally binding constraints

Exploiting strict constraints in the computation of cylindrical algebraic coverings

Efficient solution and computation of models with occasionally binding constraints

Finding Temporal Paths Under Waiting Time Constraints

Eulerian Walks in Temporal Graphs

Feature Enhanced Spatial–Temporal Trajectory Similarity Computation

Dynamics of temporal experience in active and passive waiting situations

Dynamics of temporal experience in active and passive waiting situations

Function computation under privacy, secrecy, distortion, and communication constraints

Pragmatic constraints on (adverbial) (temporal) quantification

The effect of waiting environment and perceived atmosphere on temporal experience

Computation of solutions to dynamic models with occasionally binding constraints

Efficient solution and computation of models with occasionally binding constraints

Exploiting strict constraints in the computation of cylindrical algebraic coverings

Efficient solution and computation of models with occasionally binding constraints

Finding Temporal Paths Under Waiting Time Constraints

Eulerian Walks in Temporal Graphs

Feature Enhanced Spatial–Temporal Trajectory Similarity Computation

Dynamics of temporal experience in active and passive waiting situations

Dynamics of temporal experience in active and passive waiting situations

Function computation under privacy, secrecy, distortion, and communication constraints

Pragmatic constraints on (adverbial) (temporal) quantification

The effect of waiting environment and perceived atmosphere on temporal experience

Computation of solutions to dynamic models with occasionally binding constraints

Efficient solution and computation of models with occasionally binding constraints

Exploiting strict constraints in the computation of cylindrical algebraic coverings

Efficient solution and computation of models with occasionally binding constraints

Related objects

Reset password