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.
Leah Epstein, Asaf Levin, Rob van Stee. Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica, 62(1-2):102-129, 2012. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Approximation Schemes for Packing Splittable Items with Cardinality ConstraintsLeah Epstein, Rob van Stee. waoa 2008: 232-245 [doi] Online Bin Packing with Cardinality ConstraintsLeah Epstein. siamdm, 20(4):1015-1030, 2006. [doi] Online Bin Packing with Cardinality ConstraintsLeah Epstein. esa 2005: 604-615 [doi] EPTAS for the dual of splittable bin packing with cardinality constraintG. Jaykrishnan, Asaf Levin. TCS, 979:114202, November 2023. [doi]
The following publications are possibly variants of this publication: