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. ed. / Igor Bykadorov; Vitaly Strusevich; Tatiana Tchemisova. Vol. 1090 Cham : Springer International Publishing AG, 2019. p. 390-407 (Communications in Computer and Information Science; Vol. 1090 CCIS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Plotnikov, R
& Erzin, A 2019,
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. in I Bykadorov, V Strusevich & T Tchemisova (eds),
Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. vol. 1090, Communications in Computer and Information Science, vol. 1090 CCIS, Springer International Publishing AG, Cham, pp. 390-407, 18th International Conference on Mathematical Optimization Theory and Operations Research, Ekaterinburg, Russian Federation,
08.07.2019.
https://doi.org/10.1007/978-3-030-33394-2_31APA
Vancouver
Plotnikov R
, Erzin A.
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. In Bykadorov I, Strusevich V, Tchemisova T, editors, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Vol. 1090. Cham: Springer International Publishing AG. 2019. p. 390-407. (Communications in Computer and Information Science). Epub 2019 Oct 27. doi: 10.1007/978-3-030-33394-2_31
Author
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 - Conference code: 18
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
UR - https://www.mendeley.com/catalogue/f30d3081-4888-33ae-81fb-4f65bba28f17/
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
Y2 - 8 July 2019 through 12 July 2019
ER -
