E. Kh. Gimadi, I. A. Rykov, “A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum”, Diskretn. Anal. Issled. Oper., 2015, Volume 22, Issue 3,Pages <nobr>5

This article is cited in 3 papers

A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum

E. Kh. Gimadi^a, I. A. Rykov^b

^a Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
^b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: We present a randomized approximation algorithm for the problem of finding a subset of a finite set of vectors in the Euclidean space with the maximal norm of the sum vector. We show that with an appropriate choice of parameters, the algorithm is polynomial for the problem with any fixed dimension and asymptotically optimal. Il. 1, bibliogr. 18.

Keywords: search for vector subset, randomized algorithm, asymptotical exactness.

UDC: 519.174

Received: 21.10.2014
Revised: 02.03.2015

DOI: 10.17377/daio.2015.22.465