969 search results - page 1 / 194 » An Optimal Algorithm for the Minimum Disc Cover Problem |
64
Voted
ALGORITHMICA
2008
14 years 11 months ago
2008
ICCNMC
2005
Springer
15 years 4 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
COCOON
2005
Springer
15 years 4 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
109
click to vote
IICAI
2003
15 years 4 days ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...