THE GRAPH-BIN PACKING PROBLEM

DOI10.1142/S012905411100915XzbMath1236.05193WikidataQ59072655 ScholiaQ59072655MaRDI QIDQ3224960

Csilla Bujtás, Zsolt Tuza, György Dósa, Csanád Imreh, Judit Nagy-György

Publication date: 13 March 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmgraph algorithmstime complexityonline algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40) Online algorithms; streaming algorithms (68W27)

Related Items (4)

New models of graph-bin packing ⋮ Batched bin packing revisited ⋮ Constructing generalized suffix trees on distributed parallel platforms ⋮ Locality-preserving allocations problems and coloured bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling with incompatible jobs
• Channel assignment on graphs of bounded treewidth
• On the span in channel assignment problems: Bounds, computing and counting
• On Bin Packing with Conflicts
• On-line and first fit colorings of graphs
• Randomized online graph coloring
• Labelling Graphs with a Condition at Distance 2
• An Algorithm for Subgraph Isomorphism
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Circular chromatic number: A survey

This page was built for publication: THE GRAPH-BIN PACKING PROBLEM