scientific article; zbMATH DE number 6820261
From MaRDI portal
Publication:4598212
DOI10.4230/LIPIcs.ICALP.2016.72zbMath1388.68123arXiv1604.07153MaRDI QIDQ4598212
José Verschae, Kim-Manuel Klein, Klaus Jansen
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1604.07153
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (22)
New Algorithmic Results for Bin Packing and Scheduling ⋮ Tightness of sensitivity and proximity bounds for integer linear programs ⋮ Approximation schemes for the generalized extensible bin packing problem ⋮ An APTAS for bin packing with clique-graph conflicts ⋮ On the optimality of exact and approximation algorithms for scheduling problems ⋮ An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops ⋮ On the extension complexity of scheduling polytopes ⋮ The Support of Integer Optimal Solutions ⋮ A unified framework for designing EPTAS for load balancing on parallel machines ⋮ An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints ⋮ Breaking symmetries to rescue sum of squares in the case of makespan scheduling ⋮ Symmetry exploitation for online machine covering with bounded migration ⋮ Vector scheduling with rejection on a single machine ⋮ An EPTAS for scheduling fork-join graphs with communication delay ⋮ Unnamed Item ⋮ Streaming algorithms for bin packing and vector scheduling ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing ⋮ Approximation algorithms for the multiprocessor scheduling with submodular penalties ⋮ An EPTAS for scheduling on unrelated machines of few different types ⋮ On Integer Programming and Convolution. ⋮ On minimizing the makespan when some jobs cannot be assigned on the same machine ⋮ Improved approximation algorithms for the combination problem of parallel machine scheduling and path
This page was built for publication:
