402 search results - page 8 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
125
click to vote
ICALP
2009
Springer
16 years 19 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
117
Voted
COLT
2010
Springer
14 years 10 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
113
click to vote
CC
2008
Springer
15 years 2 months ago
2008
Springer
Over the last seven years, we have developed static-analysis methods to recover a good approximation to the variables and dynamically allocated memory objects of a stripped executa...
135
click to vote
COMGEO
2004
ACM
15 years 6 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
JCSS
2010
14 years 10 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...