scientific article; zbMATH DE number 7559382
From MaRDI portal
Publication:5089171
DOI10.4230/LIPIcs.MFCS.2020.11MaRDI QIDQ5089171
Malte Skambath, Marten Maack, Malin Rau, Max Bannach, Sebastian Berndt, Alexandra Lassota, Matthias Mnich
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2007.02660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- Online variable-sized bin packing with conflicts
- Towards optimal and expressive kernelization for \(d\)-hitting set
- An efficient fixed-parameter algorithm for 3-hitting set
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- The complexity of the 0/1 multi-knapsack problem
- Matching is as easy as matrix inversion
- The average-case analysis of some on-line algorithms for bin packing
- Resource constrained scheduling as generalized bin packing
- Bin packing games
- On-line and off-line approximation algorithms for vector covering problems
- Parameterized complexity of machine scheduling: 15 open problems
- Algorithms for on-line bin-packing problems with cardinality constraints
- A new view on rural postman based on Eulerian extension and matching
- Bin packing with fixed number of bins revisited
- Approximation and online algorithms for multidimensional bin packing: a survey
- Approximation schemes for packing splittable items with cardinality constraints
- Complexity results for rainbow matchings
- 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
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
- Handbook of Approximation Algorithms and Metaheuristics
- Improved Approximation for Vector Bin Packing
- About the Structure of the Integer Cone and its Application to Bin Packing
- A Logarithmic Additive Integrality Gap for Bin Packing
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Parameterized Algorithms
