Average-case Complexity of Shortest-paths Problems

Priebe, Volker

doi:10.22028/D291-25863

Local TagsRelease HistoryDetailsSummary

Average-case Complexity of Shortest-paths Problems

Priebe, V. (2001). Average-case Complexity of Shortest-paths Problems. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-25863.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-310A-5 Version Permalink: https://hdl.handle.net/21.11116/0000-000C-79CA-9

Genre: Thesis

Files

show Files

Locators

show

hide

Locator:
http://scidok.sulb.uni-saarland.de/volltexte/2007/1180/ (Any fulltext) Open Access Green

Description:
-

OA-Status:
Green

Locator:
http://scidok.sulb.uni-saarland.de/doku/urheberrecht.php?la=de (Copyright transfer agreement) Open Access status unknown

Description:
-

OA-Status:
Not specified

Creators

show

hide

Creators:
Priebe, Volker^{1, 2}, Author
Mehlhorn, Kurt¹, Advisor
Frieze, Alan³, 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
3External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Accepted: 2001-06-01Published Online: 2007-07-06Date issued: 2001

Publication Status: Issued

Pages: -

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

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 518214
Other: Local-ID: C1256428004B93B8-4647E47D64FE6793C1256B81004BB015-PriebeDiss01
URN: urn:nbn:de:bsz:291-scidok-11807
DOI: 10.22028/D291-25863
Other: hdl:20.500.11880/25919

Degree: PhD

Event

show

Legal Case

show

Project information

show

Source

show