31 citations · 53 across the 15 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 8 cited
Set It and Forget It: Approximating the Set Once Strip Cover Problem
Amotz Bar-Noy, Ben Baumer, Dror Rawitz
We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proport…
cs.DS2012★ 3 cited
Dynamic Shortest Path Algorithms for Hypergraphs
Jianhang Gao, Qing Zhao, Wei Ren +3
A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communica…