Efficient computation of optimal temporal walks under waiting-time constraints
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2364-8228
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Bentert, Matthias
Himmel, Anne-Sophie
Nichterlein, André
Niedermeier, Rolf
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s41109-020-00311-0
- URN
-
urn:nbn:de:101:1-2020112216423010230672
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bentert, Matthias
- Himmel, Anne-Sophie
- Nichterlein, André
- Niedermeier, Rolf
- SpringerLink (Online service)
Ähnliche Objekte (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