3 citations · 11 across the 10 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.NI2013★ 2 cited
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles
Daniel Gaußmann, Stefan Hoffmann, Egon Wanke
We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wirel…
cs.DS2013
Complexity of the FIFO Stack-Up Problem
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequenc…
cs.CC2013★ 3 cited
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete
Stefan Hoffmann, Egon Wanke
We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are…