599 search results - page 15 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
113
Voted
ACSC
2007
IEEE
15 years 9 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. ...
117
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
127
click to vote
SNPD
2007
15 years 4 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...
108
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
115
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...