429 search results - page 2 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
191
Voted
IPL
1998
15 years 6 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
195
Voted
JCSS
2002
15 years 6 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
197
Voted
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
200
click to vote
CATS
1998
15 years 8 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
229
Voted
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...