2 citations · 3 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 2 cited
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable
Niclas Boehmer, Robert Bredereck, Dušan Knop +1
We study a variant of Set Cover where each element of the universe has some demand that determines how many times the element needs to be covered. Moreover, we examine two generali…
cs.DS2019
A Fast Exact Algorithm for Airplane Refueling Problem
Jianshu Li, Xiaoyin Hu, Junjie Luo +1
We consider the airplane refueling problem, where we have a fleet of airplanes that can refuel each other. Each airplane is characterized by specific fuel tank volume and fuel cons…