909 search results - page 50 / 182 » On the approximability of some network design problems |
DAC
2009
ACM
16 years 2 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
120
click to vote
PODS
2008
ACM
16 years 1 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
250
click to vote
ADHOC
2011
14 years 8 months ago
2011
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
131
click to vote
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
102
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...