Connected bin packing problem on traceable graphs

DOI10.22067/IJNAO.2021.67913.1010MaRDI QIDQ3390778zbMATH OpenFDO

Authors

Publication date 25 March 2022

Full work available at URL https://doi.org/10.22067/IJNAO.2021.67913.1010

zbMATH Keywords

approximation algorithmsbin packing problemcomplexity theoryconnectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The graph-bin packing problem
• New models of graph-bin packing
• Bin packing with colocations
• An approximation scheme for bin packing with conflicts
• An approximation scheme for bin packing with conflicts

Cites work

• An approximation scheme for bin packing with conflicts
• Approximation and inaproximability results on balanced connected partitions of graphs
• Colored bin packing: online algorithms and lower bounds
• Connected bin packing problem on traceable graphs
• Exact approaches for solving a covering problem with capacitated subtrees
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
• The bin packing problem with precedence constraints
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9

Cited in

(4)

• Bin-packing and matchings in threshold graphs
• New models of graph-bin packing
• Bin packing with colocations
• Connected bin packing problem on traceable graphs

This page was built for publication: Connected bin packing problem on traceable graphs

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