237 search results - page 5 / 48 » Approximation Algorithms for Minimum Tree Partition |
96
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
98
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
97
Voted
CCCG
2007
15 years 2 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
141
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
75
Voted
SODA
2003
ACM
15 years 2 months ago
2003
ACM
