New models of graph-bin packing

DOI10.1016/J.TCS.2016.06.008MaRDI QIDQ2629236zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Csanád Imreh, Judit Nagy-György, Zsolt Tuza, 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

zbMATH Keywords

combinatorial gamescombinatorial optimizationgraph bin-packingonline algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Combinatorial games (91A46)

Recommendations

• The graph-bin packing problem
• scientific article; zbMATH DE number 2217640
• Connected bin packing problem on traceable graphs
• On Bin Packing with Conflicts
• On Bin Packing with Conflicts

Cites work

• Bin packing with directed stackability conflicts
• Combinatorial Games
• Edge disjoint Polyp Packing
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1960287 (Why is no real title available?)
• On Bin Packing with Conflicts
• On-line and first fit colorings of graphs
• Online algorithms. The state of the art
• Online variable-sized bin packing with conflicts
• Positional games
• The graph-bin packing problem

Cited in

(2)

• The graph-bin packing problem
• Connected bin packing problem on traceable graphs

This page was built for publication: New models of graph-bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629236)