Standard

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. / Plotnikov, Roman; Erzin, Adil.

Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. ред. / Igor Bykadorov; Vitaly Strusevich; Tatiana Tchemisova. Том 1090 Cham : Springer International Publishing AG, 2019. стр. 390-407 (Communications in Computer and Information Science; Том 1090 CCIS).

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

Harvard

Plotnikov, R & Erzin, A 2019, Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. в I Bykadorov, V Strusevich & T Tchemisova (ред.), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Том. 1090, Communications in Computer and Information Science, Том. 1090 CCIS, Springer International Publishing AG, Cham, стр. 390-407, 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019, Ekaterinburg, Российская Федерация, 08.07.2019. https://doi.org/10.1007/978-3-030-33394-2_31

APA

Plotnikov, R., & Erzin, A. (2019). Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. в I. Bykadorov, V. Strusevich, & T. Tchemisova (Ред.), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers (Том 1090, стр. 390-407). (Communications in Computer and Information Science; Том 1090 CCIS). Springer International Publishing AG. https://doi.org/10.1007/978-3-030-33394-2_31

Vancouver

Plotnikov R, Erzin A. Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. в Bykadorov I, Strusevich V, Tchemisova T, Редакторы, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Том 1090. Cham: Springer International Publishing AG. 2019. стр. 390-407. (Communications in Computer and Information Science). Epub 2019 окт. 27. doi: 10.1007/978-3-030-33394-2_31

Author

Plotnikov, Roman ; Erzin, Adil. / Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Редактор / Igor Bykadorov ; Vitaly Strusevich ; Tatiana Tchemisova. Том 1090 Cham : Springer International Publishing AG, 2019. стр. 390-407 (Communications in Computer and Information Science).

BibTeX

@inproceedings{80c3f0e505764e569e9b1df84f7a4daf,
title = "Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem",
abstract = "We consider a problem of constructing an energy-efficient bounded diameter communication spanning tree when the vertices are located on a plane, and the energy required to transmit a message between a pair of vertices is proportional to the squared distance between them. For this NP-hard problem, we have developed several approximate heuristic algorithms. The results of a posteriori analysis of solutions constructed by the proposed algorithms are presented.",
keywords = "Approximation algorithms, Bounded hops, Energy efficiency, Symmetric connectivity",
author = "Roman Plotnikov and Adil Erzin",
note = "Funding Information: The research of R. Plotnikov is supported by the Russian Science Foundation (project 18-71-00084, Sections 3, 4, and 5). The research of A. Erzin is supported by the Russian Science Foundation (project 19-71-10012, Sections 1 and 2). Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG. Copyright: Copyright 2019 Elsevier B.V., All rights reserved.; 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 ; Conference date: 08-07-2019 Through 12-07-2019",
year = "2019",
doi = "10.1007/978-3-030-33394-2_31",
language = "English",
isbn = "9783030333935",
volume = "1090",
series = "Communications in Computer and Information Science",
publisher = "Springer International Publishing AG",
pages = "390--407",
editor = "Igor Bykadorov and Vitaly Strusevich and Tatiana Tchemisova",
booktitle = "Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers",
address = "Switzerland",

}

RIS

TY - GEN

T1 - Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

AU - Plotnikov, Roman

AU - Erzin, Adil

N1 - Funding Information: The research of R. Plotnikov is supported by the Russian Science Foundation (project 18-71-00084, Sections 3, 4, and 5). The research of A. Erzin is supported by the Russian Science Foundation (project 19-71-10012, Sections 1 and 2). Publisher Copyright: © 2019, Springer Nature Switzerland AG. Copyright: Copyright 2019 Elsevier B.V., All rights reserved.

PY - 2019

Y1 - 2019

N2 - We consider a problem of constructing an energy-efficient bounded diameter communication spanning tree when the vertices are located on a plane, and the energy required to transmit a message between a pair of vertices is proportional to the squared distance between them. For this NP-hard problem, we have developed several approximate heuristic algorithms. The results of a posteriori analysis of solutions constructed by the proposed algorithms are presented.

AB - We consider a problem of constructing an energy-efficient bounded diameter communication spanning tree when the vertices are located on a plane, and the energy required to transmit a message between a pair of vertices is proportional to the squared distance between them. For this NP-hard problem, we have developed several approximate heuristic algorithms. The results of a posteriori analysis of solutions constructed by the proposed algorithms are presented.

KW - Approximation algorithms

KW - Bounded hops

KW - Energy efficiency

KW - Symmetric connectivity

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

U2 - 10.1007/978-3-030-33394-2_31

DO - 10.1007/978-3-030-33394-2_31

M3 - Conference contribution

AN - SCOPUS:85076132918

SN - 9783030333935

SN - 978-3-030-33394-2

VL - 1090

T3 - Communications in Computer and Information Science

SP - 390

EP - 407

BT - Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers

A2 - Bykadorov, Igor

A2 - Strusevich, Vitaly

A2 - Tchemisova, Tatiana

PB - Springer International Publishing AG

CY - Cham

T2 - 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019

Y2 - 8 July 2019 through 12 July 2019

ER -

ID: 28277458