599 search results - page 53 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
129
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
145
Voted
ADHOCNOW
2005
Springer
15 years 8 months ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
98
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
133
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
121
Voted
VMV
2001
15 years 4 months ago
2001
Sampling points with blue noise spectral characteristics are best suited for antialiasing. Compared to Poisson disk sampling, Lloyd's relaxation scheme yields samples that ap...