Finding cores of limited length

  • Stephen Alstrup
  • Peter W. Lauridsen
  • Peer Sommerlund
  • Mikkel Thorup
Session 2B: Invited Lecture

DOI: 10.1007/3-540-63307-3_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1272)
Cite this paper as:
Alstrup S., Lauridsen P.W., Sommerlund P., Thorup M. (1997) Finding cores of limited length. In: Dehne F., Rau-Chaplin A., Sack JR., Tamassia R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Stephen Alstrup
    • 1
  • Peter W. Lauridsen
    • 1
  • Peer Sommerlund
    • 1
  • Mikkel Thorup
    • 1
  1. 1.Department of Computer ScienceUniversity of CopenhagenDenmark

Personalised recommendations