An APTAS for bin packing with clique-graph conflicts

DOI10.1007/978-3-030-83508-8_21OpenAlexW3198883588MaRDI QIDQ832868

Hadas Shachnai, Ariel Kulik, Ilan Doron-Arad

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2011.04273

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Approximation algorithms for time constrained scheduling
• Bin packing can be solved within 1+epsilon in linear time
• Approximation schemes for scheduling on parallel machines
• Bin packing with restricted piece sizes
• An approximation scheme for bin packing with conflicts
• Approximation and online algorithms for multidimensional bin packing: a survey
• On Bin Packing with Conflicts
• All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
• On minimizing the makespan when some jobs cannot be assigned on the same machine
• An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An APTAS for bin packing with clique-graph conflicts