Establishes no-PTAS hardness for interval-restricted assignment and approximation thresholds of 48/47 and 1.5 for 2- and 4-resource restricted scheduling.
10 Tomás Ebenlendr, Marek Krcál, and Jirí Sgall
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inapproximability Results for Scheduling with Interval and Resource Restrictions
Establishes no-PTAS hardness for interval-restricted assignment and approximation thresholds of 48/47 and 1.5 for 2- and 4-resource restricted scheduling.