Abstract
AbstractWe consider the approximate minimum selection problem in presence of independent random comparison faults. This problem asks to select one of the smallest k elements in a linearly-ordered collection of n elements by only performing unreliable pairwise comparisons: whenever two elements are compared, there is a small probability that the wrong comparison outcome is observed. We design a randomized algorithm that solves this problem with a success probability of at least $$1-q$$
1
-
q
for $$q \in (0, \frac{n-k}{n})$$
q
∈
(
0
,
n
-
k
n
)
and any $$k \in [1, n-1]$$
k
∈
[
1
,
n
-
1
]
using $$O\big ( \frac{n}{k} \big \lceil \log \frac{1}{q} \big \rceil \big )$$
O
(
n
k
⌈
log
1
q
⌉
)
comparisons in expectation (if $$k \ge n$$
k
≥
n
or $$q \ge \frac{n-k}{n}$$
q
≥
n
-
k
n
the problem becomes trivial). Then, we prove that the expected number of comparisons needed by any algorithm that succeeds with probability at least $$1-q$$
1
-
q
must be $${\varOmega }(\frac{n}{k}\log \frac{1}{q})$$
Ω
(
n
k
log
1
q
)
whenever q is bounded away from $$\frac{n-k}{n}$$
n
-
k
n
, thus implying that the expected number of comparisons performed by our algorithm is asymptotically optimal in this range. Moreover, we show that the approximate minimum selection problem can be solved using $$O( (\frac{n}{k} + \log \log \frac{1}{q}) \log \frac{1}{q})$$
O
(
(
n
k
+
log
log
1
q
)
log
1
q
)
comparisons in the worst case, which is optimal when q is bounded away from $$\frac{n-k}{n}$$
n
-
k
n
and $$k = O\big ( \frac{n}{\log \log \frac{1}{q}}\big )$$
k
=
O
(
n
log
log
1
q
)
.
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献