A strategic routing framework and algorithms for computing alternative paths
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), September 7-8, 2020, Pisa, Italy, virtual conference, S. 10:1-10:14
- Erschienen in
-
Open Access Series in Informatics (OASIcs) ; 85
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg
- (wer)
-
Universität Augsburg
- (wann)
-
2020
- Ereignis
-
Veröffentlichung
- (wo)
-
Dagstuhl
- (wer)
-
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- (wann)
-
2020
- Urheber
-
Bläsius, Thomas
Böther, Maximilian
Fischbeck, Philipp
Friedrich, Tobias
Gries, Alina
Hüffner, Falk
Kißig, Otto
Lenzner, Pascal
Molitor, Louise
Schiller, Leon
Wells, Armin
Wietheger, Simon
- Beteiligte Personen und Organisationen
-
Huisman, Dennis
Zaroliagis, Christos D.
- DOI
-
10.4230/OASIcs.ATMOS.2020.10
- URN
-
urn:nbn:de:bvb:384-opus4-1152409
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:56 MEZ
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
- Bläsius, Thomas
- Böther, Maximilian
- Fischbeck, Philipp
- Friedrich, Tobias
- Gries, Alina
- Hüffner, Falk
- Kißig, Otto
- Lenzner, Pascal
- Molitor, Louise
- Schiller, Leon
- Wells, Armin
- Wietheger, Simon
- Huisman, Dennis
- Zaroliagis, Christos D.
- Universität Augsburg
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Entstanden
- 2020
Ähnliche Objekte (12)
Computing Tutte paths
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shortest paths and Steiner trees in VLSI routing
Alternative routing : k-shortest paths with limited overlap
Reality-Check for DTN Routing Algorithms
Routing algorithms for time sensitive networks
Natural computing algorithms
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks
Evaluation of Alternative Paths for Reliable Routing in City Logistics
Computing Tutte paths
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shortest paths and Steiner trees in VLSI routing
Alternative routing : k-shortest paths with limited overlap
Reality-Check for DTN Routing Algorithms
Routing algorithms for time sensitive networks
Natural computing algorithms
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks
Evaluation of Alternative Paths for Reliable Routing in City Logistics
Computing Tutte paths
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shortest paths and Steiner trees in VLSI routing
Alternative routing : k-shortest paths with limited overlap
Reality-Check for DTN Routing Algorithms
Routing algorithms for time sensitive networks
Natural computing algorithms
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks