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

被引：0
|
作者：
Kel'manov A.V. [1 ,2 ]
Romanchenko S.M. [2 ]
机构：
[1] Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4
[2] Novosibirsk State University, ul. Pirogova 2
来源：
Journal of Applied and Industrial Mathematics | 2012年 / 6卷 / 1期
基金：
俄罗斯基础研究基金会;
关键词：
efficient approximation algorithm; NP-hardness; search for a vector subset;
D O I：
10.1134/S1990478912010097
中图分类号：
学科分类号：
摘要：
One of the problems in data analysis was earlier reduced to a specific NP-hard optimization problem of finding in a given vector set in the Euclidean space a subset of a given cardinality such that the subset consists of the vectors that are "close" to each other by the criterion of the minimum sum of squared distances. In the paper an efficient 2-approximation algorithm is proposed for solving this problem. © 2012 Pleiades Publishing, Ltd.
引用
收藏
页码：90 / 96
页数：6
相关论文
共 50 条
  • [41] An Advanced Crow Search Algorithm for Solving Global Optimization Problem
    Lee, Donwoo
    Kim, Jeonghyun
    Shon, Sudeok
    Lee, Seungjae
    APPLIED SCIENCES-BASEL, 2023, 13 (11):
  • [42] A parallel tabu search algorithm for solving the container loading problem
    Bortfeldt, A
    Gehring, H
    Mack, D
    PARALLEL COMPUTING, 2003, 29 (05) : 641 - 662
  • [43] Crow search algorithm for solving optimal power flow problem
    Saha, Anulekha
    Bhattacharya, Aniruddha
    Das, Priyanath
    Chakraborty, Ajoy Kumar
    PROCEEDINGS OF THE 2017 IEEE SECOND INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER AND COMMUNICATION TECHNOLOGIES (ICECCT), 2017,
  • [44] A tabu search algorithm for solving economic lot scheduling problem
    S. A. Raza
    A. Akgunduz
    M. Y. Chen
    Journal of Heuristics, 2006, 12
  • [45] Dynamic Local Search Algorithm for Solving Traveling Salesman Problem
    Ghandeshtani, Kambiz Shojaee
    Taghadosi, Mojtaba Behnam
    Seyedkashi, Seyed Mohammad Hossein
    Shojaii, Keyvan
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ADVANCED ENGINEERING COMPUTING AND APPLICATIONS IN SCIENCES (ADVCOMP 2010), 2010, : 53 - 58
  • [46] Solving the sum-of-ratios problem by a stochastic search algorithm
    Wei-Ying Wu
    Ruey-Lin Sheu
    Ş. İlker Birbil
    Journal of Global Optimization, 2008, 42
  • [47] A discrete gravitational search algorithm for solving the cell formation problem
    Zettam, Manal
    INTELLIGENT DECISION TECHNOLOGIES-NETHERLANDS, 2018, 12 (03): : 335 - 348
  • [48] A Binary Cuckoo Search Algorithm for Solving the Set Covering Problem
    Soto, Ricardo
    Crawford, Broderick
    Olivares, Rodrigo
    Barraza, Jorge
    Johnson, Franklin
    Paredes, Fernando
    BIOINSPIRED COMPUTATION IN ARTIFICIAL SYSTEMS, PT II, 2015, 9108 : 88 - 97
  • [49] Truck and Trailer Routing Problem Solving by a Backtracking Search Algorithm
    Shiyi YUAN
    Jianwen FU
    Feng CUI
    Xin ZHANG
    Journal of Systems Science and Information, 2020, 8 (03) : 253 - 272
  • [50] Harmony Search Algorithm for Solving Set-Covering Problem
    Salas, Juan
    Crawford, Broderick
    Soto, Ricardo
    Gomez Rubio, Alvaro
    Jaramillo, Adrian
    Mansilla Villablanca, Sebastian
    Olguin, Eduardo
    TRENDS IN APPLIED KNOWLEDGE-BASED SYSTEMS AND DATA SCIENCE, 2016, 9799 : 917 - 930
12345