- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Reihe CI ; 220-06
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2006
- Urheber
-
Neumann, Frank
Witt, Carsten
- Handle
-
2003/26127
- URN
-
urn:nbn:de:101:1-20160613958
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Neumann, Frank
- Witt, Carsten
- Universitätsbibliothek Dortmund
Entstanden
- 2006
Ähnliche Objekte (12)
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
Clustering with Minimum Spanning Trees: How Good Can It Be?
On the complexity of the bilevel minimum spanning tree problem
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
Clustering with Minimum Spanning Trees: How Good Can It Be?
On the complexity of the bilevel minimum spanning tree problem
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
Clustering with Minimum Spanning Trees: How Good Can It Be?