Approximating Bin Packing within O(log OPT * Log Log OPT) Bins

@article{Rothvoss2013ApproximatingBP,
  title={Approximating Bin Packing within O(log OPT * Log Log OPT) Bins},
  author={Thomas Rothvoss},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={20-29}
}
  • Thomas Rothvoss
  • Published in
    IEEE 54th Annual Symposium on…
    2013
  • Mathematics, Computer Science
  • For bin packing, the input consists of n items with sizes between 0 and 1, which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log2 OPT) bins. We provide the first improvement in now 3 decades and show that one can find a solution of cost OPT + O(log OPT * log log OPT) in polynomial time. This is achieved by rounding a fractional solution to the Gilmore-Gomory LP relaxation using the Entropy… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 40 CITATIONS

    About the Structure of the Integer Cone and its Application to Bin Packing

    VIEW 8 EXCERPTS
    HIGHLY INFLUENCED

    Approximation and online algorithms for multidimensional bin packing: A survey

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Bin packing, number balancing, and rescaling linear programs

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Algorithms for combinatorial discrepancy

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Approximation algorithms for multidimensional bin packing

    VIEW 9 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Rounding using Random Walks-An Experimental Study

    VIEW 3 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    An Optimal Algorithm for 1-D Cutting Stock Problem

    VIEW 3 EXCERPTS
    CITES METHODS

    High Multiplicity Strip Packing

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 30 REFERENCES

    Bin packing can be solved within 1 + ε in linear time

    VIEW 14 EXCERPTS
    HIGHLY INFLUENTIAL

    Beck's Three Permutations Conjecture: A Counterexample and Some Consequences

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Constructive Discrepancy Minimization by Walking on the Edges

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    An efficient approximation scheme for the one-dimensional bin-packing problem

    VIEW 21 EXCERPTS
    HIGHLY INFLUENTIAL

    The Design of Approximation Algorithms

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Discrepancy of Set-systems and Matrices

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Near-optimal bin packing algorithms

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    The entropy rounding method in approximation algorithms

    VIEW 3 EXCERPTS