18 search results - page 4 / 4 » PTAS for maximum weight independent set problem with random ... |
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
MOBIHOC
2009
ACM
14 years 5 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...