Packing-constrained point coverings

Details Packing-constrained point coverings Packing-constrained point coverings

2011-01-18

arxiv.org/abs/1101.3468v1

Mathematics

Metric Geometry

8 pages, 4 figures

Scientific paper

In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number of points N for which such a configuration exists and obtain the bounds 11 <= N <= 55. The disparity of these bounds is symptomatic, we believe, of the fact that PC^2 belongs in a higher complexity class than the standard packing and covering problems.

Affiliated with

Also associated with

No associations

Rating

Packing-constrained point coverings 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 Packing-constrained point coverings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packing-constrained point coverings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-287036