A strategic routing framework and algorithms for computing alternative paths

to related objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch
Notes
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

Bibliographic citation
Open Access Series in Informatics (OASIcs) ; 85

Event
Veröffentlichung
(where)
Augsburg
(who)
Universität Augsburg
(when)
2020
Event
Veröffentlichung
(where)
Dagstuhl
(who)
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
(when)
2020
Creator
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 
Contributor
Huisman, Dennis
Zaroliagis, Christos D.

DOI
10.4230/OASIcs.ATMOS.2020.10
URN
urn:nbn:de:bvb:384-opus4-1152409
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:21 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

  • 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

Time of origin

  • 2020

Other Objects (12)

Computing Tutte paths

Computing Tutte paths

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shortest paths and Steiner trees in VLSI routing

Hochschulschrift

Shortest paths and Steiner trees in VLSI routing

Alternative routing : k-shortest paths with limited overlap

Alternative routing : k-shortest paths with limited overlap

Journal on vehicle routing algorithms

Zeitschrift

Journal on vehicle routing algorithms

Packet Routing: Complexity and Algorithms

Packet Routing: Complexity and Algorithms

Natural computing algorithms

Natural computing algorithms

Algorithms for knapsacks, paths and strings

Algorithms for knapsacks, paths and strings

Reality-Check for DTN Routing Algorithms

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Routing algorithms for time sensitive networks

Related objects