7930 search results - page 104 / 1586 » Greedy in Approximation Algorithms |
156
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
150
click to vote
CCCG
2006
15 years 7 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
137
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...