Login / Signup
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.
Flávio Keidi Miyazawa
Lehilton L. C. Pedrosa
Rafael Crivellari Saliba Schouery
Maxim Sviridenko
Yoshiko Wakabayashi
Published in:
CoRR (2014)
Keyphrases
</>
approximation schemes
packing problem
approximation algorithms
bin packing
special case
integer programming
cutting stock
np hard
worst case
dc programming
computational complexity
primal dual
optimal solution
lower bound