Sciweavers

19 search results - page 1 / 4
» Asymptotics of greedy energy points
Sort
View
MOC
2010
12 years 11 months ago
Asymptotics of greedy energy points
A. López García, Edward B. Saff
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
14 years 5 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
ICDCS
2008
IEEE
13 years 11 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
ICDCS
2002
IEEE
13 years 10 months ago
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
In-network data aggregation is essential for wireless sensor networks where energy resources are limited. In a previously proposed data dissemination scheme (directed diffusion wi...
Chalermek Intanagonwiwat, Deborah Estrin, Ramesh G...