Exponential inapproximability and FPTAS for scheduling with availability constraints

From MaRDI portal
Revision as of 22:20, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1029337

DOI10.1016/J.TCS.2009.03.012zbMath1188.68083OpenAlexW2005313518MaRDI QIDQ1029337

Bin Fu, Hairong Zhao, Yumei Huo

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.012




Related Items (6)




Cites Work




This page was built for publication: Exponential inapproximability and FPTAS for scheduling with availability constraints