11 citations · 29 across the 16 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
On fully dynamic constant-factor approximation algorithms for clustering problems
Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese
Clustering is an important task with applications in many fields of computer science. We study the fully dynamic setting in which we want to maintain good clusters efficiently when…
cs.DS2021
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem
Arindam Khan, Arnab Maiti, Amatya Sharma +1
In two-dimensional geometric knapsack problem, we are given a set of n axis-aligned rectangular items and an axis-aligned square-shaped knapsack. Each item has integral width, inte…