Approximation schemes for packing splittable items with cardinality constraints

DOI10.1007/s00453-010-9445-6zbMath1236.90067OpenAlexW2027739190MaRDI QIDQ2428665

Asaf Levin, Leah Epstein, Rob van Stee

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9445-6

zbMATH Keywords

approximation schemescardinality constraintsbin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (11)

Scheduling shared continuous resources on many-cores ⋮ Scheduling with interjob communication on parallel processors ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Exactly solving packing problems with fragmentation ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ A study on load-balanced variants of the bin packing problem ⋮ Scheduling with Interjob Communication on Parallel Processors ⋮ Unnamed Item ⋮ Bin packing problem with conflicts and item fragmentation

Cites Work

• Unnamed Item
• Unnamed Item
• On the efficiency of polynomial time approximation schemes
• Parallelism versus memory allocation in pipelined router forwarding engines
• Approximation schemes for packing with item fragmentation
• An application of simultaneous diophantine approximation in combinatorial optimization
• Bin packing can be solved within 1+epsilon in linear time
• Algorithms for on-line bin-packing problems with cardinality constraints
• Cardinality constrained bin-packing problems
• AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
• Improved Results for a Memory Allocation Problem
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Approximation schemes for ordered vector packing problems
• Online Bin Packing with Cardinality Constraints
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs

This page was built for publication: Approximation schemes for packing splittable items with cardinality constraints