10 citations · 22 across the 8 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.OC2019
Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
Roman Plotnikov, Adil Erzin
We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists of the construction of communication spanning tree on a given graph, where the total energy consum…
cs.NI2019
GLS and VNS Based Heuristics for Conflict-Free Minimum-Latency Aggregation Scheduling in WSN
Roman Plotnikov, Adil Erzin, Vyacheslav Zalyubovskiy
We consider a conflict-free minimum latency data aggregation problem that occurs in different wireless networks. Given a network that is presented as an undirected graph with one s…
cs.DS2019
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
Roman Plotnikov, Adil Erzin
We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consum…