@book{b2332a926cf14ff09a3e805b2157cae8,
title = "Finding Cores of Limited Length",
abstract = "In this paper we consider several well-studied variants of the problem of finding a core if a prescribed length in a tree. Here a core is a path minimizing the sum of the distance to all nodes in the tree. Our most general result is an O(n log n a(n)) algorithm for the case with weighted tree edges. The previous best bound was O(n3) due to minieka (networks, 1985)",
keywords = "Tree structures, Path optimization, Distance minimization, Algorithm complexity, Weighted edges",
author = "Stephen Alstrup and Mikkel Thorup and Lauridsen, \{Peter W.\} and Peer Sommerlund",
year = "2001",
month = jul,
language = "English",
series = "IT University Technical Report Series",
number = "TR-2000-4",
publisher = "IT-Universitetet i K{\o}benhavn",
address = "Denmark",
edition = "TR-2000-4",
}