Exact pseudopolynomial algorithm for one sequence partitioning problem

DOI10.1134/S0005117917010052MaRDI QIDQ2362334zbMATH OpenFDO

Authors A. V. Kel'manov, S. A. Khamidullin, Vladimir Khandeev

Publication date 7 July 2017

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

partitionNP-hardnessEuclidean spacesequence of vectorsexact pseudopolynomial algorithmminimal sum of squared distances

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
• An approximating polynomial algorithm for a sequence partitioning problem
• A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
• An approximation polynomial-time algorithm for a sequence bi-clustering problem
• Approximation algorithm for the problem of partitioning a sequence into clusters

Cites work

• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(3)

• An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
• 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence
• An approximating polynomial algorithm for a sequence partitioning problem

Describes a project that uses

Uses Software

• PRMLT
• ElemStatLearn

This page was built for publication: Exact pseudopolynomial algorithm for one sequence partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362334)