External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items

Arindam Khan 0001, Eklavya Sharma. Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. In Mary Wootters, Laura Sanità, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). Volume 207 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Authors

Arindam Khan 0001

This author has not been identified. Look up 'Arindam Khan 0001' in Google

Eklavya Sharma

This author has not been identified. Look up 'Eklavya Sharma' in Google
runs on