Optimal Cuts and Partitions in Tree Metrics in Polynomial Time

Abstract

We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one dimensional geometric metric settings. Our method of solution could be also of independent interest in other applications. We… (More)
DOI: 10.1016/j.ipl.2013.03.009

Topics

3 Figures and Tables

Slides referencing similar topics