237 search results - page 9 / 48 » Approximation Algorithms for Minimum Tree Partition |
145
Voted
OL
2010
14 years 9 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
132
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
108
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
153
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
135
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...