scientific article
From MaRDI portal
Publication:3115657
zbMath1249.90211MaRDI QIDQ3115657
E. Kh. Gimadi, N. I. Glebov, Artem V. Pyatkin, Alexei E. Baburin
Publication date: 10 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems ⋮ Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem ⋮ A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum ⋮ An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors ⋮ A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem ⋮ On the complexity of some Euclidean optimal summing problems ⋮ Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters ⋮ Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster ⋮ Exact pseudopolynomial algorithms for a balanced 2-clustering problem ⋮ Solving some vector subset problems by Voronoi diagrams ⋮ PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem ⋮ An exact algorithm for finding a vector subset with the longest sum ⋮ On the complexity and approximability of some Euclidean optimal summing problems ⋮ Complexity and approximation of finding the longest vector sum ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems ⋮ Approximability of the Problem of Finding a Vector Subset with the Longest Sum
This page was built for publication:
