144 search results - page 8 / 29 » Unit disk graph approximation |
180
click to vote
APWEB
2006
Springer
15 years 9 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
106
Voted
DAGSTUHL
2006
15 years 7 months ago
2006
211
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
162
click to vote
STACS
2010
Springer
16 years 26 days ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...