Geometric knapsack problems

We study a variety of geometric versions of the classical knapsack problem. In particular, we consider the following “fence enclosure” problem: given a setS ofn points in the plane with valuesvi ≥ 0, we wish to enclose a subset of the points with a fence (a simple closed curve) in order to maximize the “value” of the enclosure. The value of the enclosure is defined to be the sum of the values of the enclosed points minus the cost of the fence. We consider various versions of the problem, such as allowingS to consist of points and/or simple polygons. Other versions of the problems are obtained by restricting the total amount of fence available and also allowing the enclosure to consist of at mostM connected components. When there is an upper bound on the length of fence available, we show that the problem is NP-complete. We also provide polynomial-time algorithms for many versions of the fence problem when an unrestricted amount of fence is available.

[1]  David P. Dobkin,et al.  Finding Extremal Polygons , 1985, SIAM J. Comput..

[2]  David M. Mount,et al.  An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Gerhard J. Woeginger,et al.  Geometric Clusterings , 1991, J. Algorithms.

[4]  J. Moon,et al.  Some packing and covering theorems , 1967 .

[5]  Peter Eades,et al.  The complexity of computing minimum separating polygons , 1993, Pattern Recognit. Lett..

[6]  Clyde L. Monma,et al.  Optimal enclosing regions in planar graphs , 1989, Networks.

[7]  László Lovász,et al.  Polyhedral Results for Antimatroids a , 1989 .

[8]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[9]  David Eppstein,et al.  Finding minimum areak-gons , 1992, Discret. Comput. Geom..

[10]  D. T. Lee,et al.  The Power of Geometric Duality Revisited , 1985, Inf. Process. Lett..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[13]  Chee-Keng Yap,et al.  A polynomial solution for the potato-peeling problem , 1986, Discret. Comput. Geom..

[14]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[15]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[16]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[17]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[18]  Alok Aggarwal,et al.  Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.

[19]  G. Nemhauser,et al.  Integer Programming , 2020 .

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[21]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[22]  Xiaojun Shen,et al.  Covering convex sets with non-overlapping polygons , 1990, Discret. Math..

[23]  David M. Mount,et al.  Packing and Covering the Plane with Translates of a Convex Polygon , 1990, J. Algorithms.