scientific article
From MaRDI portal
Publication:3115233
zbMath1249.68080MaRDI QIDQ3115233
Alexander Kel'Manov, Artem V. Pyatkin
Publication date: 20 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center ⋮ Solving some vector subset problems by Voronoi diagrams ⋮ Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems ⋮ Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space ⋮ An FPTAS for a vector subset search problem ⋮ Complexity of the weighted max-cut in Euclidean space
This page was built for publication:
