376 search results - page 32 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
FOCS
1993
IEEE
13 years 12 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
SIGMETRICS
2010
ACM
14 years 16 days ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...