Login / Signup

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs.

Esther GalbyAndrea MunaroShizhou Yang
Published in: CoRR (2023)
Keyphrases
  • approximation schemes
  • computational complexity
  • packing problem
  • upper bound
  • bin packing
  • computer vision