Geometric Knapsack problems
From MaRDI portal
Publication:689105
DOI10.1007/BF01769706zbMath0781.68109OpenAlexW2061213672MaRDI QIDQ689105
Joseph S. B. Mitchell, Samir Khuller, Esther M. Arkin
Publication date: 17 February 1994
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01769706
Related Items
Optimizing some constructions with bars: new geometric knapsack problems, Counting convex polygons in planar point sets, Exact and heuristic solutions for the prize‐collecting geometric enclosure problem, From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices, Bounds for point recolouring in geometric graphs, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Delineating boundaries for imprecise regions, Peeling meshed potatoes, Minimum perimeter-sum partitions in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering convex sets with non-overlapping polygons
- The power of geometric duality revisited
- A polynomial solution for the Potato-peeling problem
- Geometric applications of a matrix-searching algorithm
- Finding minimum area \(k\)-gons
- Packing and covering the plane with translates of a convex polygon
- Finding Extremal Polygons
- Geometric clusterings
- Approximation schemes for covering and packing problems in image processing and VLSI
- Optimal enclosing regions in planar graphs
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- The complexity of computing minimum separating polygons
