scientific article; zbMATH DE number 7559382

DOI10.4230/LIPICS.MFCS.2020.11MaRDI QIDQ5089171zbMATH OpenFDO

Authors Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/2007.02660

zbMATH Keywords

bin packingfixed-parameter tractableknapsackmatching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A logarithmic additive integrality gap for bin packing
• A new view on rural postman based on Eulerian extension and matching
• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
• A shortcut to (sun)flowers: kernels in logarithmic space or linear time
• About the structure of the integer cone and its application to bin packing
• Algorithms for on-line bin-packing problems with cardinality constraints
• An efficient fixed-parameter algorithm for 3-hitting set
• Approximation and online algorithms for multidimensional bin packing: a survey
• Approximation schemes for packing splittable items with cardinality constraints
• Bin packing games
• Bin packing with fixed number of bins revisited
• Complexity results for rainbow matchings
• Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
• Handbook of Approximation Algorithms and Metaheuristics
• scientific article; zbMATH DE number 4195184 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 871933 (Why is no real title available?)
• scientific article; zbMATH DE number 6472627 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Improved Approximation for Vector Bin Packing
• Matching is as easy as matrix inversion
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• On-line and off-line approximation algorithms for vector covering problems
• Online variable-sized bin packing with conflicts
• Parameterized algorithms
• Parameterized complexity of machine scheduling: 15 open problems
• Polynomiality for bin packing with a constant number of item types
• Resource constrained scheduling as generalized bin packing
• The average-case analysis of some on-line algorithms for bin packing
• The complexity of the 0/1 multi-knapsack problem
• There is no asymptotic PTAS for two-dimensional vector packing
• Towards optimal and expressive kernelization for \(d\)-hitting set

Cited in

(4)

• Parameterized complexity of configuration integer programs
• Improved approximation for two-dimensional vector multiple knapsack
• Improved approximation for two-dimensional vector multiple knapsack
• Parameterized algorithms for matching integer programs with additional rows and columns

This page was built for publication:

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