Shortest Paths in Time-Dependent Networks ant their Applications

Pyrga, Evangelia

Local TagsRelease HistoryDetailsSummary

Shortest Paths in Time-Dependent Networks ant their Applications

Pyrga, E. (2005). Shortest Paths in Time-Dependent Networks ant their Applications. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-D754-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-D755-2

Genre: Thesis

Files

show Files

Locators

show

Creators

show

hide

Creators:
Pyrga, Evangelia^{1, 2}, Author
Mehlhorn, Kurt¹, Advisor
Zaroliagis, Christos¹, Referee

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2005-01Date issued: 2005

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Evangelia2005

Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show