New models of graph-bin packing
From MaRDI portal
Publication:2629236
DOI10.1016/j.tcs.2016.06.008zbMath1345.68277OpenAlexW2420521769WikidataQ59072412 ScholiaQ59072412MaRDI QIDQ2629236
Csanád Imreh, Zsolt Tuza, Judit Nagy-György, Csilla Bujtás, György Dósa
Publication date: 5 July 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.008
Combinatorial optimization (90C27) Combinatorial games (91A46) Online algorithms; streaming algorithms (68W27)
Cites Work
- Online variable-sized bin packing with conflicts
- Online algorithms. The state of the art
- Edge disjoint Polyp Packing
- Positional games
- THE GRAPH-BIN PACKING PROBLEM
- On Bin Packing with Conflicts
- On-line and first fit colorings of graphs
- Combinatorial Games
- Bin packing with directed stackability conflicts
- Unnamed Item
- Unnamed Item
This page was built for publication: New models of graph-bin packing