An approximation algorithm for solving a problem of search for a vector subset-Reference-Cited by-同舟云学术

An approximation algorithm for solving a problem of search for a vector subset

Published:2012-01 Issue:1 Volume:6 Page:90-96
ISSN:1990-4789
Container-title:Journal of Applied and Industrial Mathematics
language:en
Short-container-title:J. Appl. Ind. Math.

Author:

Kel’manov A. V.,Romanchenko S. M.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Industrial and Manufacturing Engineering

Link

http://link.springer.com/content/pdf/10.1134/S1990478912010097.pdf

Reference3 articles.

1. A. V. Kel’manov and A. V. Pyatkin, “NP-Completeness of Some Problems of Choosing a Vector Subset,” Diskret. Anal. Issled. Oper. 17(5), 37–45 (2010) [J. Appl. Indust. Math. 5 (3), 352–357 (2011)].

2. A.W. F. Edwards and L. L. Cavalli-Sforza, “A Method for Cluster Analysis,” Biometrics 21, 362–375 (1965).

3. H. Wirth, Algorithms + Data Structures = Programs (Prentice Hall, New Jersey, 1976).

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation;Lecture Notes in Computer Science;2020

2. 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence;Lecture Notes in Computer Science;2020

3. Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem;Mathematical Optimization Theory and Operations Research;2020

4. An Accelerated Exact Algorithm for the One-Dimensional M-Variance Problem;Pattern Recognition and Image Analysis;2019-10

5. Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space;Computational Mathematics and Mathematical Physics;2019-05