Sciweavers

1760 search results - page 16 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
ALGOSENSORS
2006
Springer
13 years 11 months ago
Area Based Beaconless Reliable Broadcasting in Sensor Networks
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
Francisco Javier Ovalle-Martínez, Amiya Nay...
NETWORKING
2008
13 years 9 months ago
On the Applicability of Knowledge Based NAT-Traversal for Home Networks
The presence of Network Address Translation (NAT) is a hindrance when accessing services within home networks, because NAT breaks the end-to-end connectivity model of the Internet ...
Andreas Müller, Andreas Klenk, Georg Carle
MST
2010
187views more  MST 2010»
13 years 2 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda