370 search results - page 29 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
179
click to vote
JCO
2006
15 years 1 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
117
click to vote
SNPD
2007
15 years 3 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
133
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
127
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
103
click to vote
ACSC
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...