scientific article; zbMATH DE number 6862114
From MaRDI portal
Publication:4636620
DOI10.4230/LIPIcs.STACS.2017.22zbMath1402.68085MaRDI QIDQ4636620
Dániel Marx, Lin Chen, Deshi Ye, Guo-Chuan Zhang
Publication date: 19 April 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (10)
On the optimality of exact and approximation algorithms for scheduling problems ⋮ Structural parameters for scheduling with assignment restrictions ⋮ Faster Algorithms for Integer Programs with Block Structure ⋮ Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Unnamed Item ⋮ Improved approximation algorithms for two-stage flowshops scheduling problem ⋮ An EPTAS for scheduling on unrelated machines of few different types ⋮ Scheduling meets \(n\)-fold integer programming ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times
This page was built for publication:
