Login / Signup

Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems.

Chandra ChekuriKent Quanrud
Published in: SODA (2017)
Keyphrases
  • approximation schemes
  • packing problem
  • bin packing
  • cutting stock
  • approximation algorithms
  • worst case
  • numerical methods
  • integer programming
  • search tree
  • np complete
  • computer vision