scientific article; zbMATH DE number 7053284
From MaRDI portal
Publication:5743405
zbMath1422.68313MaRDI QIDQ5743405
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095148
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Approximation and online algorithms for multidimensional bin packing: a survey ⋮ An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound ⋮ Better Bin Packing Approximations via Discrepancy Theory ⋮ Algorithmic Aspects of Combinatorial Discrepancy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Bin packing with rejection revisited
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Discrepancy of set-systems and matrices
- Global wire routing in two-dimensional arrays
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- ``Integer-making theorems
- Bin packing can be solved within 1+epsilon in linear time
- The ellipsoid method and its consequences in combinatorial optimization
- Semidefinite programming in combinatorial optimization
- An exact duality theory for semidefinite programming and its complexity implications
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- A fast asymptotic approximation scheme for bin packing with rejection
- Bin packing problems with rejection penalties and their dual problems
- The Trim Problem
- An improved LP-based approximation for steiner tree
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- The Design of Approximation Algorithms
- The Train Delivery Problem - Vehicle Routing Meets Bin Packing
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- Iterative Methods in Combinatorial Optimization
- A Linear Programming Approach to the Cutting-Stock Problem
- Dependent rounding and its applications to approximation algorithms
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Six Standard Deviations Suffice
- The NP-completeness column: an ongoing guide
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Approximate graph coloring by semidefinite programming
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Multicolour Discrepancies
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Applications of approximation algorithms to cooperative games
- Bin Packing with Rejection Revisited
- Probability and Computing
- On a Combinatorial Problem of Erdos
- Geometric discrepancy. An illustrated guide
- Combinatorial optimization. Theory and algorithms.
This page was built for publication:
