Standard

On vector summation problem in the euclidean space. / Gimadi, Edward Kh; Rykov, Ivan A.; Shamardin, Yury V.

Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, 2018. стр. 131-136 (Communications in Computer and Information Science; Том 871).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Gimadi, EK, Rykov, IA & Shamardin, YV 2018, On vector summation problem in the euclidean space. в Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Communications in Computer and Information Science, Том. 871, Springer-Verlag GmbH and Co. KG, стр. 131-136, 7th International Conference on Optimization Problems and Their Applications, OPTA 2018, Omsk, Российская Федерация, 08.06.2018. https://doi.org/10.1007/978-3-319-93800-4_11

APA

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

Vancouver

Gimadi EK, Rykov IA, Shamardin YV. On vector summation problem in the euclidean space. в Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer-Verlag GmbH and Co. KG. 2018. стр. 131-136. (Communications in Computer and Information Science). doi: 10.1007/978-3-319-93800-4_11

Author

Gimadi, Edward Kh ; Rykov, Ivan A. ; Shamardin, Yury V. / On vector summation problem in the euclidean space. Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, 2018. стр. 131-136 (Communications in Computer and Information Science).

BibTeX

@inproceedings{c9445d010c60487ab5bbf2de38ed2d0d,
title = "On vector summation problem in the euclidean space",
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.",
keywords = "Euclidean space, Exact algorithm, Sum vector, Vector subset",
author = "Gimadi, {Edward Kh} and Rykov, {Ivan A.} and Shamardin, {Yury V.}",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.; 7th International Conference on Optimization Problems and Their Applications, OPTA 2018 ; Conference date: 08-06-2018 Through 14-06-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-93800-4_11",
language = "English",
isbn = "9783319937991",
series = "Communications in Computer and Information Science",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "131--136",
booktitle = "Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers",
address = "Germany",

}

RIS

TY - GEN

T1 - On vector summation problem in the euclidean space

AU - Gimadi, Edward Kh

AU - Rykov, Ivan A.

AU - Shamardin, Yury V.

N1 - Publisher Copyright: © Springer International Publishing AG, part of Springer Nature 2018.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Euclidean space

KW - Exact algorithm

KW - Sum vector

KW - Vector subset

UR - http://www.scopus.com/inward/record.url?scp=85049696495&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-93800-4_11

DO - 10.1007/978-3-319-93800-4_11

M3 - Conference contribution

AN - SCOPUS:85049696495

SN - 9783319937991

T3 - Communications in Computer and Information Science

SP - 131

EP - 136

BT - Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers

PB - Springer-Verlag GmbH and Co. KG

T2 - 7th International Conference on Optimization Problems and Their Applications, OPTA 2018

Y2 - 8 June 2018 through 14 June 2018

ER -

ID: 14464522