Bin packing with fixed number of bins revisited
From MaRDI portal
Publication:1936245
DOI10.1016/j.jcss.2012.04.004zbMath1261.68065OpenAlexW2063525042MaRDI QIDQ1936245
Dániel Marx, Klaus Jansen, Stefan Kratsch, Ildikó Schlotter
Publication date: 21 February 2013
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2012.04.004
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (43)
On the generalized bin packing problem ⋮ Envy-free allocations respecting social networks ⋮ Parameterized Resiliency Problems via Integer Linear Programming ⋮ Iterated Type Partitions ⋮ Algorithmic analysis of priority-based bin packing ⋮ Sorting by multi-cut rearrangements ⋮ Edge-disjoint packing of stars and cycles ⋮ Edge-Disjoint Packing of Stars and Cycles ⋮ Polynomial kernels for weighted problems ⋮ A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Parameterized complexity of configuration integer programs ⋮ Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges ⋮ Problems hard for treewidth but easy for stable gonality ⋮ Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees ⋮ Parameterized complexity of finding a spanning tree with minimum reload cost diameter ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Equitable scheduling on a single machine ⋮ Scheduling and fixed-parameter tractability ⋮ Refining the complexity of the sports elimination problem ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ Disentangling the computational complexity of network untangling ⋮ Priority-based bin packing with subset constraints ⋮ Extended MSO model checking via small vertex integrity ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Parameterized complexity of strip packing and minimum volume packing ⋮ Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines ⋮ An optimization model for freight transport using urban rail transit ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The clever shopper problem ⋮ Bounding the Running Time of Algorithms for Scheduling and Packing Problems ⋮ Complexity of tree-coloring interval graphs equitably ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Unnamed Item ⋮ The complexity of tree partitioning ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Scheduling meets \(n\)-fold integer programming ⋮ Parameterized resiliency problems
This page was built for publication: Bin packing with fixed number of bins revisited
