Sciweavers

1760 search results - page 39 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
IJSNET
2008
138views more  IJSNET 2008»
13 years 7 months ago
Energy-efficient connected-coverage in wireless sensor networks
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
Ionut Cardei, Mihaela Cardei
MOBIHOC
2002
ACM
14 years 7 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 10 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
MA
2001
Springer
139views Communications» more  MA 2001»
14 years 4 days ago
Flying Emulator: Rapid Building and Testing of Networked Applications for Mobile Computers
This paper presents a mobile-agent framework for building and testing mobile computing applications. When a portable computing device is moved into and attached to a new network, t...
Ichiro Satoh
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
14 years 2 months ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf