Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



  history
ID: 279123.0, MPI für Informatik / Algorithms and Complexity Group
Shortest Paths in Time-Dependent Networks and their Applications
Authors:Pyrga, Evangelia
Language:English
Date of Approval (YYYY-MM-DD):2005
Name of University:Universität des Saarlandes
Place of University:Saarbrücken, Saarland
Audience:Experts Only
Last Change of the Resource (YYYY-MM-DD):2005-11-09
Document Type:Thesis
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-634E44B0D3AA54F3C12570AE0044FCDA-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.