## New models of graph-bin packing

- Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
- Theor. Comput. Sci.
- 2016

A graph is called a p{polyp if it consists of p simple paths of the same length and one endvertex of all these paths is a common vertex. The Polyp Packing problem is a generalization of the well known Bin Packing problem: How to pack a set of paths with diierent lengths to a set of polyps edge disjointly? It is proved that the Polyp Packing problem is NP… (More)

Sorry, we couldn't extract any figures or tables for this paper.