scientific article
From MaRDI portal
Publication:2836761
zbMath1274.90251MaRDI QIDQ2836761
Alexander Kel'Manov, Artem V. Pyatkin
Publication date: 3 July 2013
Full work available at URL: http://mathnet.ru/eng/zvmmf/v52/i12/p2284
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenessalgorithmic complexitychoice of subsequence of vectorsminimum of sum of square of distances
Related Items (max. 100)
On the complexity of some Euclidean optimal summing problems ⋮ On the complexity and approximability of some Euclidean optimal summing problems ⋮ Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
This page was built for publication:
