599 search results - page 23 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
APPROX
2000
Springer
14 years 1 days ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
PPL
2008
13 years 7 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...