237 search results - page 1 / 48 » Approximation Algorithms for Minimum Tree Partition |
DAM
1998
13 years 10 months ago
1998
JCO
2006
13 years 11 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
IPL
2002
13 years 10 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
CVPR
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...