Finding cores of limited length

Finding cores of limited length

In this paper we consider the problem of finding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This problem has been examined under different constraints on the tree and on the set of paths, from which the core can be chosen....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Alstrup, Stephen, Lauridsen, Peter W., Sommerlund, Peer, Thorup, Mikkel
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Core Problem
Exact sciences and technology
Leaf Tree
Linear Time Algorithm
Lower Envelope
Piecewise Linear Function
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we consider the problem of finding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This problem has been examined under different constraints on the tree and on the set of paths, from which the core can be chosen. For all cases, we present linear or almost linear time algorithms, which improves the previous results due to Lo and Peng, J. Algorithms Vol. 20, 1996 and Minieka, Networks Vol. 15, 1985.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-63307-3_47