On the Two-Dimensional Knapsack Problem for Convex Polygons

07/31/2020
by   Arturo Merino, et al.
0

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly into the knapsack. We allow to rotate the polygons by arbitrary angles. We present a quasi-polynomial time O(1)-approximation algorithm for the general case and a polynomial time O(1)-approximation algorithm if all input polygons are triangles, both assuming polynomially bounded integral input data. Also, we give a quasi-polynomial time algorithm that computes a solution of optimal weight under resource augmentation, i.e., we allow to increase the size of the knapsack by a factor of 1+δ for some δ>0 but compare ourselves with the optimal solution for the original knapsack. To the best of our knowledge, these are the first results for two-dimensional geometric knapsack in which the input objects are more general than axis-parallel rectangles or circles and in which the input polygons can be rotated by arbitrary angles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2019

Breaking the Barrier of 2 for the Storage Allocation Problem

Packing problems are an important class of optimization problems. The pr...
research
02/12/2020

Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive

Persuasion studies how an informed principal may influence the behavior ...
research
08/05/2022

A PTAS for Minimizing Weighted Flow Time on a Single Machine

An important objective in scheduling literature is to minimize the sum o...
research
07/14/2021

A QPTAS for stabbing rectangles

We consider the following geometric optimization problem: Given n axis-a...
research
02/28/2019

Fair Dimensionality Reduction and Iterative Rounding for SDPs

We model "fair" dimensionality reduction as an optimization problem. A c...
research
10/30/2017

Rectangle Transformation Problem

In this paper, we propose the rectangle transformation problem (RTP) and...
research
07/13/2018

Approximation Algorithms for Clustering via Weighted Impurity Measures

An impurity measures I:R^k →R^+ maps a k-dimensional vector v to a non-...

Please sign up or login with your details

Forgot password? Click here to reset