7150 search results - page 397 / 1430 » An Approximation Algorithm for Approximation Rank |
184
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
285
click to vote
DC
2011
14 years 6 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
201
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
160
click to vote
ICRA
2006
IEEE
16 years 26 days ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
157
click to vote
DAM
2006
15 years 6 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...