Sciact
  • EN
  • RU

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem Full article

Journal Communications in Computer and Information Science
ISSN: 1865-0929
Output data Year: 2019, Volume: 1090, Pages: 390-407 Pages count : 18 DOI: 10.1007/978-3-030-33394-2_31
Tags Approximation algorithms; Bounded hops; Energy efficiency; Symmetric connectivity
Authors Plotnikov Roman 1 , Erzin A. 1,2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Plotnikov R. , Erzin A.
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
Communications in Computer and Information Science. 2019. V.1090. P.390-407. DOI: 10.1007/978-3-030-33394-2_31 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85076132918
OpenAlex: W2987841077
Citing:
DB Citing
Scopus 1
OpenAlex 3
Altmetrics: