scientific article
From MaRDI portal
Publication:2917206
zbMath1247.68021MaRDI QIDQ2917206
Cheng, T. C. Edwin, Eugene Levner, Amir Elalouf
Publication date: 27 September 2012
Full work available at URL: http://www.jucs.org/jucs_17_13/an_improved_FPTAS_for
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (4)
An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem ⋮ Improving the solution complexity of the scheduling problem with deadlines: A general technique ⋮ Fast approximation algorithms for routing problems with hop-wise constraints ⋮ Strongly polynomial FPTASes for monotone dynamic programs
This page was built for publication:
