An APTAS for bin packing with clique-graph conflicts
type: Item
instance of: scholarly article
title: An APTAS for bin packing with clique-graph conflicts
DOI: 10.1007/978-3-030-83508-8_21
author: Ilan Doron-Arad
author: Ariel Kulik
author: Hadas Shachnai
publication date: 2022-03-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2011.04273
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498684
MaRDI profile type: Publication
OpenAlex ID: W3198883588
cites work: All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
cites work: Approximation schemes for scheduling on parallel machines
cites work: Approximation and online algorithms for multidimensional bin packing: a survey
cites work: On minimizing the makespan when some jobs cannot be assigned on the same machine
cites work: On Bin Packing with Conflicts
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Q3002852
cites work: An approximation scheme for bin packing with conflicts
cites work: An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
cites work: Q4598212
cites work: Approximation algorithms for time constrained scheduling
cites work: Bin packing with restricted piece sizes
cites work: Q4290987
cites work: Q3002782
description: scientific article; zbMATH DE number 7498684