237 search results - page 4 / 48 » Approximation Algorithms for Minimum Tree Partition |
DC
2008
14 years 11 months ago
2008
IPPS
2003
IEEE
15 years 4 months ago
2003
IEEE
119
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
100
click to vote
CCCG
2007
15 years 1 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
116
click to vote
CATS
2006
15 years 28 days ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...