1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2020★ 1 cited
Approximation Algorithms for The Generalized Incremental Knapsack Problem
Yuri Faenza, Danny Segev, Lingyi Zhang
We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack. In this setting, we are given a set of item…
cs.DS2019
Dynamic Optimality Refuted -- For Tournament Heaps
J. Ian Munro, Richard Peng, Sebastian Wild +1
We prove a separation between offline and online algorithms for finger-based tournament heaps undergoing key modifications. These heaps are implemented by binary trees with keys st…