论文信息 - On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension

On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension

The problems under study are connected with the choice of a vector subset from a given finite set of vectors in the Euclidean space ℝk. The sum norm and averaged square of the sumnorm are considered as the target functions (to be maximized). The optimal combinatorial algorithms with time complexity O(k2n2k) are developed for these problems. Thus, the polynomial solvability of these problems is proved for k fixed.

A. V. Pyatkin | E. Kh. Gimadi | I. A. Rykov

[1] Polynomial algorithms for solving the vector sum problem , 2007 .

[2] A. V. Pyatkin,et al. On a version of the problem of choosing a vector subset , 2009 .

[3] The problem of finding a subset of vectors with the maximum total weight , 2008 .

[4] E. Kh. Gimadi,et al. On two problems of choosing some subset of vectors with integer coordinates that has maximum norm of the sum of elements in Euclidean space , 2009 .