7930 search results - page 536 / 1586 » Greedy in Approximation Algorithms |
179
click to vote
ICALP
2010
Springer
15 years 12 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
205
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
199
click to vote
COMPUTING
2006
15 years 7 months ago
2006
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
155
click to vote
IJCAI
1997
15 years 8 months ago
1997
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...
191
click to vote
JC
2006
15 years 7 months 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...