7150 search results - page 18 / 1430 » An Approximation Algorithm for Approximation Rank |
SIAMCOMP
1998
15 years 2 days ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
ECCC
2007
15 years 11 days ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
100
Voted
JC
2006
15 years 11 days ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
DAGSTUHL
2004
15 years 1 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
152
click to vote
TKDE
2012
13 years 2 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...