In this paper we consider the problem of finding a core of weighted interval trees. A core of an interval graph is a path contains some intervals of graph so that the sum of distances from all intervals to this path is minimized. We show that intervals on core of a tree should be maximal, then a linear time algorithm is presented to find the core of interval trees
Rights and permissions | |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |