7150 search results - page 396 / 1430 » An Approximation Algorithm for Approximation Rank |
173
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
150
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
318
Voted
CODCRY
2011
Springer
14 years 10 months ago
2011
Springer
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classi...
224
click to vote
STACS
2005
Springer
16 years 9 days ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...