On vector summation problem in the euclidean space

Edward Kh Gimadi, Ivan A. Rykov, Yury V. Shamardin

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

We consider a problem of finding a subset of the smallest size in the given set of vectors such that the norm of sum vector is greater or equal to some given value. We show that the problem can be solved optimally with the same complexity as the problem of finding the subset of given cardinality with minimum norm of sum vector.

Original languageEnglish
Title of host publicationOptimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers
PublisherSpringer-Verlag GmbH and Co. KG
Pages131-136
Number of pages6
ISBN (Print)9783319937991
DOIs
Publication statusPublished - 1 Jan 2018
Event7th International Conference on Optimization Problems and Their Applications, OPTA 2018 - Omsk, Russian Federation
Duration: 8 Jun 201814 Jun 2018

Publication series

NameCommunications in Computer and Information Science
Volume871
ISSN (Print)1865-0929

Conference

Conference7th International Conference on Optimization Problems and Their Applications, OPTA 2018
CountryRussian Federation
CityOmsk
Period08.06.201814.06.2018

Keywords

  • Euclidean space
  • Exact algorithm
  • Sum vector
  • Vector subset

Fingerprint Dive into the research topics of 'On vector summation problem in the euclidean space'. Together they form a unique fingerprint.

  • Cite this

    Gimadi, E. K., Rykov, I. A., & Shamardin, Y. V. (2018). On vector summation problem in the euclidean space. In Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers (pp. 131-136). (Communications in Computer and Information Science; Vol. 871). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-319-93800-4_11