scientific article
From MaRDI portal
Publication:2998954
zbMath1224.93139MaRDI QIDQ2998954
E. Kh. Gimadi, M. A. Kel'Manova, Alexander Kel'Manov, Sergey Khamidullin
Publication date: 11 May 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estimation and detection in stochastic control theory (93E10) Signal detection and filtering (aspects of stochastic processes) (60G35) Prefix, length-variable, comma-free codes (94A45)
Related Items (24)
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 ⋮ A randomized algorithm for a sequence 2-clustering problem ⋮ NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes ⋮ 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 ⋮ A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence ⋮ 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 ⋮ On polynomial solvability of one quadratic Euclidean clustering problem on a line ⋮ Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem ⋮ Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems ⋮ The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension ⋮ NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors ⋮ Asymptotically optimal approach for solving some hard discrete optimization problems
This page was built for publication:
