Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Steiner tree heuristic in the Euclidean d-space using bottleneck distances
Stephan Sloth Lorenzen
,
Pawel Winter
Department of Computer Science
92
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Steiner tree heuristic in the Euclidean d-space using bottleneck distances'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Minimum Spanning Tree
100%
Bottleneck Distance
100%
Solution Quality
33%
Delaunay Tessellation
33%
Efficient Heuristics
33%
Computer Science
Minimum Spanning Tree
100%
Solution Quality
33%
Mathematics
Tree Problem
33%
Dimensional Space
33%
Spanning Tree
33%