The entropy rounding method in approximation algorithms
From MaRDI portal
Recommendations
Cites work
- ``Integer-making theorems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A fast asymptotic approximation scheme for bin packing with rejection
- A Linear Programming Approach to the Cutting-Stock Problem
- AFPTAS results for common variants of bin packing: a new method for handling the small items
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- An exact duality theory for semidefinite programming and its complexity implications
- An improved LP-based approximation for Steiner tree
- Applications of approximation algorithms to cooperative games
- Approximate graph coloring by semidefinite programming
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Approximation algorithms for scheduling unrelated parallel machines
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing problems with rejection penalties and their dual problems
- Bin packing with rejection revisited
- Bin Packing with Rejection Revisited
- Combinatorial optimization. Theory and algorithms.
- Dependent rounding and its applications to approximation algorithms
- Discrepancy of set-systems and matrices
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Geometric discrepancy. An illustrated guide
- Global wire routing in two-dimensional arrays
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 5764883 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- scientific article; zbMATH DE number 1380581 (Why is no real title available?)
- scientific article; zbMATH DE number 6472647 (Why is no real title available?)
- Iterative methods in combinatorial optimization.
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Multicolour Discrepancies
- On a Combinatorial Problem of Erdos
- Probability and Computing
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Semidefinite programming in combinatorial optimization
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- Six Standard Deviations Suffice
- The design of approximation algorithms
- The ellipsoid method and its consequences in combinatorial optimization
- The NP-completeness column: an ongoing guide
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The train delivery problem -- vehicle routing meets bin packing
- The trim problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- Approximation and online algorithms for multidimensional bin packing: a survey
- Better bin packing approximations via discrepancy theory
- An algorithm for Komlós conjecture matching Banaszczyk's bound
- On Thurston’s core entropy algorithm
- Algorithmic aspects of combinatorial discrepancy
- A tight (1.5+)-approximation for unsplittable capacitated vehicle routing on trees
This page was built for publication: The entropy rounding method in approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743405)
