The following pages link to S. M. Romanchenko (Q2261719):
Displaying 6 items.
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← links)
- Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов (Q2838802) (← links)
- (Q3115249) (← links)
- An Approximation Scheme for the Problem of Finding a Subsequence (Q4636841) (← links)
- Approximation algorithms for some intractable problems of choosing a vector subsequence (Q5263772) (← links)
- An FPTAS for a vector subset search problem (Q5264739) (← links)
