108 search results - page 3 / 22 » On the computational complexity of partial covers of Theta g... |
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
STOC
2010
ACM
14 years 17 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
WG
2004
Springer
14 years 1 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...