TU Darmstadt / ULB / TUbiblio

Reload cost problems: minimum diameter spanning tree

Wirth, H.-C. and Stefan, J. (2001):
Reload cost problems: minimum diameter spanning tree.
In: Discrete applied mathematics, 113pp. S. 73-85, [Article]

Item Type: Article
Erschienen: 2001
Creators: Wirth, H.-C. and Stefan, J.
Title: Reload cost problems: minimum diameter spanning tree
Language: German
Journal or Publication Title: Discrete applied mathematics
Volume: 113
Divisions: 20 Department of Computer Science
Date Deposited: 19 Nov 2008 16:28
License: [undefiniert]
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details