7006 search results - page 245 / 1402 » Approximation Algorithms |
163
click to vote
TCC
2007
Springer
16 years 13 days ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
136
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
150
click to vote
AUSAI
2004
Springer
15 years 11 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
164
Voted
WEA
2005
Springer
15 years 11 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
149
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...