A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
From MaRDI portal
Recommendations
- An approximating polynomial algorithm for a sequence partitioning problem
- Approximation algorithm for the problem of partitioning a sequence into clusters
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem
Cites work
- scientific article; zbMATH DE number 6004955 (Why is no real title available?)
- scientific article; zbMATH DE number 6004969 (Why is no real title available?)
- A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
- A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
- A randomized algorithm for two-cluster partition of a set of vectors
- An FPTAS for a vector subset search problem
- An approximating polynomial algorithm for a sequence partitioning problem
- An approximation algorithm for a problem of cluster analysis
- An approximation polynomial-time algorithm for a sequence bi-clustering problem
- An introduction to statistical learning. With applications in R
- Complexity of certain problems of searching for subsets of vectors and cluster analysis
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- Machine learning. The art and science of algorithms that make sense of data.
- NP-hardness of Euclidean sum-of-squares clustering
- Off-line detection of a quasi-periodically recurring fragment in a numerical sequence
- On complexity of some problems of cluster analysis of vector sequences
- On the complexity of some cluster analysis problems
- On the complexity of some data analysis problems
- Pattern recognition and machine learning.
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Posterior detection of a given number of identical subsequences in a quasi-periodic sequence
- The problem of finding a subset of vectors with maximal total weight
Cited in
(11)- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
- A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem
- An approximation scheme for the problem of finding a subsequence
- Exact pseudopolynomial algorithm for one sequence partitioning problem
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Approximation algorithm for the problem of partitioning a sequence into clusters
- An approximation polynomial-time algorithm for a sequence bi-clustering problem
- An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities
- A randomized algorithm for a sequence 2-clustering problem
- An approximating polynomial algorithm for a sequence partitioning problem
This page was built for publication: A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186861)
