280 search results - page 26 / 56 » Distributed Approximation Algorithms for Planar Graphs |
126
Voted
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
116
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
183
Voted
PKDD
2010
Springer
15 years 2 days ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
97
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
124
Voted
SIROCCO
2001
15 years 3 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...