EPTAS for the dual of splittable bin packing with cardinality constraint
From MaRDI portal
Publication:6057843
DOI10.1016/j.tcs.2023.114202arXiv2204.04685OpenAlexW4386914427MaRDI QIDQ6057843
Publication date: 26 October 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.04685
Cites Work
- On the efficiency of polynomial time approximation schemes
- Exactly solving packing problems with fragmentation
- Approximation algorithms for scheduling unrelated parallel machines
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
- Parallelism versus memory allocation in pipelined router forwarding engines
- Bin packing can be solved within 1+epsilon in linear time
- Approximation schemes for scheduling on parallel machines
- An approximation algorithm for the generalized assignment problem
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Algorithms for on-line bin-packing problems with cardinality constraints
- Cardinality constrained bin-packing problems
- Bin packing problem with conflicts and item fragmentation
- Online bin packing with cardinality constraints resolved
- The bin packing problem with item fragmentation: a worst-case analysis
- A study on load-balanced variants of the bin packing problem
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
- Integer Programming with a Fixed Number of Variables
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- Closing the Gap for Makespan Scheduling via Sparsification Techniques
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Approximation schemes for ordered vector packing problems
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
This page was built for publication: EPTAS for the dual of splittable bin packing with cardinality constraint
