Approximation Schemes for Packing Splittable Items with Cardinality Constraints

Epstein, Leah; Levin, Asaf; van Stee, Rob

doi:10.1007/s00453-010-9445-6

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Approximation Schemes for Packing Splittable Items with Cardinality Constraints

MPS-Authors

/persons/resource/persons45543

van Stee, Rob
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Epstein, L., Levin, A., & van Stee, R. (2012). Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica, 62, 102-129. doi:10.1007/s00453-010-9445-6.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-C4BB-1

Abstract

There is no abstract available