2 papers
cs.DS2018
Generalized budgeted submodular set function maximization
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco +1
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subse…
cs.GT2017
On Colorful Bin Packing Games
Vittorio Bilò, Francesco Cellinese, Giovanna Melideo +1
We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of $m\g…