179 search results - page 26 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
124
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
102
click to vote
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
101
click to vote
DCOSS
2006
Springer
15 years 2 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
123
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...