Covering a line segment with variable radius discs

Details Covering a line segment with variable radius discs Covering a line segment with variable radius discs

2007-07-19

arxiv.org/abs/0707.2921v1

Computer Science

Discrete Mathematics

21 pages, 2 figures

Scientific paper

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, and a variable component that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors in terms of fixed and variable costs, the problem becomes NP-hard. A branch-and-bound algorithm as well as an efficient heuristic are developed. The heuristic very often obtains the optimal solution as shown in extensive computational testing.

Affiliated with

Also associated with

No associations

Rating

Covering a line segment with variable radius discs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Covering a line segment with variable radius discs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering a line segment with variable radius discs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545119