7930 search results - page 138 / 1586 » Greedy in Approximation Algorithms |
157
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
179
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
173
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
158
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
163
click to vote
APPROX
2007
Springer
16 years 16 days ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...