2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence
From MaRDI portal
Publication:5122316
DOI10.1007/978-3-030-40616-5_34OpenAlexW3006185228MaRDI QIDQ5122316
Anna Panasenko, Alexander Kel'Manov, Sergey Khamidullin
Publication date: 22 September 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_34
approximation algorithmEuclidean spacepolynomial timequadratic variationNP-hard problemsequence of pointsweighted 2-partition
Cites Work
- NP-hardness of some quadratic Euclidean 2-clustering problems
- Posterior detection of a given number of identical subsequences in a quasi-periodic sequence
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- Exact pseudopolynomial algorithm for one sequence partitioning problem
- Clustering of time series data -- a survey
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem
- A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
- An approximating polynomial algorithm for a sequence partitioning problem
- An FPTAS for a vector subset search problem
- A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
