Skip to main content
Top

2018 | OriginalPaper | Chapter

On Vector Summation Problem in the Euclidean Space

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

Published in: Optimization Problems and Their Applications

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Baburin, A., Pyatkin, A.: Polynomial algorithms for solving the vector sum problem. J. Appl. Industr. Math. 1(3), 268–272 (2007)CrossRef Baburin, A., Pyatkin, A.: Polynomial algorithms for solving the vector sum problem. J. Appl. Industr. Math. 1(3), 268–272 (2007)CrossRef
2.
go back to reference Baburin, A., Gimadi, E., Glebov, N., Pyatkin, A.: The problem of finding a subset of vectors with the maximum total weight. J. Appl. Industr. Math. 2(1), 32–38 (2008)MathSciNetCrossRef Baburin, A., Gimadi, E., Glebov, N., Pyatkin, A.: The problem of finding a subset of vectors with the maximum total weight. J. Appl. Industr. Math. 2(1), 32–38 (2008)MathSciNetCrossRef
3.
go back to reference Gimadi, E., Kel’manov, A., Kel’manova, M., Khamidullin, S.: A posteriori detecting a quasiperiodic fragment in a numerical sequence. Pattern Recogn. Image Anal. 18(1), 30–42 (2008)CrossRef Gimadi, E., Kel’manov, A., Kel’manova, M., Khamidullin, S.: A posteriori detecting a quasiperiodic fragment in a numerical sequence. Pattern Recogn. Image Anal. 18(1), 30–42 (2008)CrossRef
4.
go back to reference Gimadi, E., Pyatkin, A., Rykov, I.: On polynomial solvability of some problems of a vector subset choice in a euclidean space of fixed dimension. J. Appl. Industr. Math. 4(48), 48–53 (2010)CrossRef Gimadi, E., Pyatkin, A., Rykov, I.: On polynomial solvability of some problems of a vector subset choice in a euclidean space of fixed dimension. J. Appl. Industr. Math. 4(48), 48–53 (2010)CrossRef
5.
go back to reference Gimadi, E., Rykov, I.: A randomized algorithm for finding a subset of vectors with the maximum euclidean norm of their sum. J. Appl. Industr. Math. 9(3), 351–357 (2015)CrossRef Gimadi, E., Rykov, I.: A randomized algorithm for finding a subset of vectors with the maximum euclidean norm of their sum. J. Appl. Industr. Math. 9(3), 351–357 (2015)CrossRef
6.
go back to reference Pyatkin, A.: On the complexity of the maximum sum length vectors subset choice problem. J. Appl. Industr. Math. 4(4), 549–552 (2010)MathSciNetCrossRef Pyatkin, A.: On the complexity of the maximum sum length vectors subset choice problem. J. Appl. Industr. Math. 4(4), 549–552 (2010)MathSciNetCrossRef
7.
go back to reference Shenmaier, V.: Solving some vector subset problems by voronoi diagrams. J. Appl. Industr. Math. 10(4), 550–566 (2016)MathSciNetCrossRef Shenmaier, V.: Solving some vector subset problems by voronoi diagrams. J. Appl. Industr. Math. 10(4), 550–566 (2016)MathSciNetCrossRef
Metadata
Title
On Vector Summation Problem in the Euclidean Space
Authors
Edward Kh. Gimadi
Ivan A. Rykov
Yury V. Shamardin
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-93800-4_11

Premium Partner