DC FieldValueLanguage
dc.contributor.authorPlotnikov, Romanen
dc.contributor.authorErzin, Adilen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:41:58Z-
dc.date.available2020-05-02T16:41:58Z-
dc.date.issued2016-10-20en
dc.identifier.isbn978-0-735-41438-9en
dc.identifier.issn0094-243Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2424-
dc.description.abstractWe consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing the total transmission power consumptions. We propose several new heuristics based on the variable neighborhood search metaheuristic for the approximation solution of the problem.We have performed a numerical experiment where all proposed algorithms have been executed on the randomly generated test samples. For these instances, on average, our algorithms outperform the previously known heuristics.en
dc.publisherAmerican Institute of Physics-
dc.relationRussian Foundation for Basic Research (grant no. 16-37- 60006)-
dc.relationRussian Foundation for Basic Research (grant no. 16-07- 00552)-
dc.relationMinistry of Education and Science, Republic of Kazakhstan, project no. 0115PK00546-
dc.relation.ispartofAIP Conference Proceedingsen
dc.titleApproximation algorithms for the min-power symmetric connectivity problemen
dc.typeConference Paperen
dc.identifier.doi10.1063/1.4965333en
dc.identifier.scopus2-s2.0-84995466881en
dc.relation.volume1776en
item.openairetypeConference Paper-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

Page view(s)

65
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.