5595 search results - page 138 / 1119 » Approximation Algorithms for Clustering Problems |
139
Voted
IPCO
2001
15 years 6 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
156
click to vote
EUROCAST
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
134
Voted
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
163
click to vote
ALMOB
2006
15 years 5 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
145
Voted
ISCC
2006
IEEE
15 years 11 months ago
2006
IEEE
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...