500 search results - page 13 / 100 » Approximation algorithms for maximum independent set of pseu... |
113
click to vote
CORR
2010
Springer
15 years 8 days ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
106
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
110
click to vote
TCS
2010
15 years 2 days ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
101
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...