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 条

[21] Solving the Economic Dispatch Problem with Tabu Search Algorithm
Khamsawang, S
Boonseng, C
Pothiya, S
IEEE ICIT' 02: 2002 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY, VOLS I AND II, PROCEEDINGS, 2002, : 274 - 278
[22] An 8-approximation algorithm for the subset feedback vertex set problem
Even, G
Naor, JS
Zosin, L
SIAM JOURNAL ON COMPUTING, 2000, 30 (04) : 1231 - 1252
[23] An 8-approximation algorithm for the subset feedback vertex set problem
Even, G
Naor, J
Zosin, L
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 310 - 319
[24] A local search approximation algorithm for the multiway cut problem
Bloch-Hansen, Andrew
Samei, Nasim
Solis-Oba, Roberto
DISCRETE APPLIED MATHEMATICS, 2023, 338 : 8 - 21
[25] CONVEX APPROXIMATION OF THE NP-HARD SEARCH PROBLEM IN FEATURE SUBSET SELECTION
Naghibi, Tofigh
Hoffmann, Sarah
Pfister, Beat
2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 3273 - 3277
[26] A fast approximation algorithm for solving the complete set packing problem
Tri-Dung Nguyen
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 237 (01) : 62 - 70
[27] Iterative greedy algorithm for solving the FIR paraunitary approximation problem
Tkacenko, A
Vaidyanathan, PP
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (01) : 146 - 160
[28] A genetic algorithm for solving the inverse problem of support vector machines
Wang, XZ
He, Q
Chen, DG
Yeung, D
NEUROCOMPUTING, 2005, 68 : 225 - 238
[29] Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
Laarhoven, Thijs
Mosca, Michele
van de Pol, Joop
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2013, 2013, 7932 : 83 - 101
[30] Adaptive local search algorithm for solving car sequencing problem
Yilmazlar, I. Ozan
Kurz, Mary E.
JOURNAL OF MANUFACTURING SYSTEMS, 2023, 68 : 635 - 643

← 1 2 3 4 5 →