Exact pseudopolynomial algorithm for one sequence partitioning problem

DOI10.1134/S0005117917010052zbMath1366.90225MaRDI QIDQ2362334

Sergey Khamidullin, Alexander Kel'Manov, Vladimir Khandeev

Publication date: 7 July 2017

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

zbMATH Keywords

partitionEuclidean spaceNP-hardnesssequence of vectorsexact pseudopolynomial algorithmminimal sum of squared distances

Mathematics Subject Classification ID

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

Related Items (1)

2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence

Uses Software

• ElemStatLearn
• PRMLT

Cites Work

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

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