3875 search results - page 133 / 775 » Approximation algorithms for the 0-extension problem |
127
Voted
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
155
click to vote
ECCC
2006
15 years 4 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
172
click to vote
ASAP
2004
IEEE
15 years 8 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
139
click to vote
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
123
Voted
STOC
2002
ACM
16 years 4 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...