2 citations · 6 across the 11 of their papers we have counts for
8 papers · 1 filter
Online Geometric Packing through Online TSP Scheduling
Anders Aamand, Mikkel Abrahamsen, Simon Bartlmae +3
We consider the problem of online packing of convex polygons into a strip by translations. While online algorithms with a constant competitive ratio have been known for rectangles…
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
Pritam Acharya, Sujoy Bhore, Aaryan Gupta +3
We study the geometric knapsack problem in which we are given a set of -dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that…
On Approximation Schemes for Stabbing Rectilinear Polygons
Arindam Khan, Aditya Subramanian, Tobias Widmann +1
We study the problem of stabbing rectilinear polygons, where we are given rectilinear polygons in the plane that we want to stab, i.e., we want to select horizontal line segmen…
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
Arindam Khan, Aditya Lonkar, Saladi Rahul +2
Set cover and hitting set are fundamental problems in combinatorial optimization which are well-studied in the offline, online, and dynamic settings. We study the geometric version…
A PTAS for the horizontal rectangle stabbing problem
Arindam Khan, Aditya Subramanian, Andreas Wiese
We study rectangle stabbing problems in which we are given axis-aligned rectangles in the plane that we want to stab, i.e., we want to select line segments such that for each g…
A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
Waldo Gálvez, Arindam Khan, Mathieu Mari +3
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given a set of axis-parallel rectangles in the plane and the goal is to select a subset of non-overl…