![Operations research / Combinatorial optimization / NP-complete problems / Mathematical optimization / Dynamic programming / Knapsack problem / Job shop scheduling / Optimization problem / Polynomial-time approximation scheme / Theoretical computer science / Computational complexity theory / Applied mathematics Operations research / Combinatorial optimization / NP-complete problems / Mathematical optimization / Dynamic programming / Knapsack problem / Job shop scheduling / Optimization problem / Polynomial-time approximation scheme / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/a448934097d9d11f1c0996b18093ece1.jpg)
| Document Date: 2013-04-15 10:32:13 Open Document File Size: 199,49 KBShare Result on Facebook
City Haifa / / Country Italy / / / / IndustryTerm dual approximation algorithm / greedy algorithms / rst solution / storage management / polynomial time algorithm / multimedia storage sub-systems / greedy algorithm / complicated algorithm / inefficient solutions / disk sub-systems / above algorithm / efficient solutions / approximate solutions / designated integral processing times / feasible solutions / approximation algorithms / rst algorithm / infeasible solution / / Organization Fund for the Promotion of Research / Technion V / Tami Tamir‡ Department / Smoler Research Fund / Technion / / Person Tami Tamir / / / Position Author / Prime Minister / Contact author / / Technology above algorithm / rst algorithm / obtaining approximation algorithms / load balancing / polynomial time algorithm / LRTF algorithm / Greedy algorithm / approximation algorithms / second algorithm / dual approximation algorithm / /
SocialTag |