4 citations · 4 across the 3 of their papers we have counts for
4 papers
Greedy Set Cover Estimations
Hakob Aslanyan
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
Sorting Algorithms with Restrictions
Hakob Aslanyan
Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as compariso…
Interference minimization in physical model of wireless networks
Hakob Aslanyan
Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is co…
Randomly Roving Agents in Wireless Sensor Networks
Hakob Aslanyan, Jose Rolim
Quantitative characterization of randomly roving agents in wireless sensor networks (WSN) is studied. Below the formula simplifications, regarding the known results and publication…