When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Machine scheduling with earliness, tardiness and non-execution penalties
Computers and Operations Research
Job scheduling methods for reducing waiting time variance
Computers and Operations Research
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Note: FPTAS for half-products minimization with scheduling applications
Discrete Applied Mathematics
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
A generic approach to proving NP-hardness of partition type problems
Discrete Applied Mathematics
| Hi-index | 0.00 |