4 citations · 4 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2011★ 4 cited
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.
cs.DM2011
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…