280 search results - page 35 / 56 » Distributed Approximation Algorithms for Planar Graphs |
MOBIHOC
2012
ACM
11 years 11 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
WG
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...