The Graph-Bin Packing Problem
Time: 14:30 -- Location: LIX
We introduce and study a very general graph-theoretical decision & optimization problem, which includes many fundamental problems as its subproblems. Some of the notable ones are Chromatic number, Subgraph isomorphism, 3-partition, and Bin packing from which the problem's name has been coined. The algorithmic scenarios include the offline as well as the online setting, and a game version is introduced, too.
(joint work with Csilla Bujtás, György Dósa, Csanád Imreh, and Judit Nagy-György)