7930 search results - page 127 / 1586 » Greedy in Approximation Algorithms |
161
click to vote
COR
2006
15 years 6 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
158
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
164
click to vote
JUCS
2008
15 years 6 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
174
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...