|
Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 5, Pages 20–34
(Mi da547)
|
|
|
|
This article is cited in 32 scientific papers (total in 32 papers)
On one variant of the vectors subset choice problem
A. V. Kel'manov, A. V. Pyatkin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
One variant of the problem of a posteriori (off-line) noise proof search for the unknown repeating vector in the case, when the noise is additive, can be reduced to the “similar” vectors subset choice problem. This problem is proved to be NP-complete. A polynomial approximation algorithm with guaranteed relative error bounds in the case of the fixed dimension of the space is suggested for this problem. Bibl. 13.
Keywords:
numerical vector sequence, a posteriori processing, repeating vector, optimal noise proof detecting, complexity, NP-completeness, approximation algorithm.
Received: 01.04.2008
Citation:
A. V. Kel'manov, A. V. Pyatkin, “On one variant of the vectors subset choice problem”, Diskretn. Anal. Issled. Oper., 15:5 (2008), 20–34; J. Appl. Industr. Math., 3:4 (2009), 447–455
Linking options:
https://www.mathnet.ru/eng/da547 https://www.mathnet.ru/eng/da/v15/i5/p20
|
|