Approximation Schemes for Packing Splittable Items with Cardinality Constraints

DOI10.1007/978-3-540-77918-6_19zbMath1130.90387OpenAlexW4236291536MaRDI QIDQ5443386

Leah Epstein, Rob van Stee

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_19

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Scheduling with interjob communication on parallel processors ⋮ Scheduling with Interjob Communication on Parallel Processors ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Improved results for a memory allocation problem ⋮ Approximation of the \(k\)-batch consolidation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Parallelism versus memory allocation in pipelined router forwarding engines
• 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
• 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 and Online Algorithms

This page was built for publication: Approximation Schemes for Packing Splittable Items with Cardinality Constraints