We introduce the problem of hub-laminar decomposition which generalizes that of computing a shortest path with minimum eccentricity. It consists in decomposing a graph into several paths that collectively have small eccentricity and meet only near their extremities. The problem is also related to that of binning appearing in biology in the context of metagenomics. We show that a graph having such a decomposition with sufficient long paths can be decomposed with approximated guar-anties on the parameters of the decomposition.

中文翻译：

---

将图分解为具有有界离心率的最短路径

我们引入了中心层分解问题，该问题概括了计算具有最小偏心率的最短路径的问题。它包括将一个图分解成几个路径，这些路径共同具有小的偏心率并且仅在它们的末端附近相遇。该问题还与宏基因组学背景下生物学中出现的分箱有关。我们表明，具有足够长路径的这种分解的图可以用分解参数的近似保证来分解。