Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken

Local TagsRelease HistoryDetailsSummary

Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken

Bramer, A. (2003). Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2E8F-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A718-E

Genre: Thesis

show

show

hide

Creators:
Bramer, Andreas¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): deu - German

Dates: Modified: 2004-06-16Accepted: 2003Date issued: 2003

Publication Status: Issued

Pages: -

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

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 201915
Other: Local-ID: C1256428004B93B8-871E334ACBA1588FC1256E190050DF62-BramerDipl03

Degree: Master

show

show

show

show