𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Open problems in real-time scheduling

✍ Scribed by Sanjoy Baruah; Kirk Pruhs


Book ID
106429634
Publisher
Springer US
Year
2009
Tongue
English
Weight
236 KB
Volume
13
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Polynomial time approximation algorithms
✍ Petra Schuurman; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 91 KB πŸ‘ 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy