✦ LIBER ✦

Semi-online Machine Covering on Two Uniform Machines with Known Total Size

✍ Scribed by Z. Y. Tan; S. J. Cao

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-online scheduling with known maximu

✍ Qian Cao; Zhaohui Liu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 758 KB

Semi-online scheduling on two uniform ma

✍ Sheng-Yi Cai; Qi-Fan Yang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 592 KB

Preemptive Semi–online Algorithms for Pa

✍ Yong He; Hao Zhou; Yi Wei Jiang 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 168 KB

Optimal Preemptive Online Algorithms for

✍ Yong He; Yi Wei Jiang; Hao Zhou 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 189 KB

Optimal algorithms for semi-online preem

✍ Yong He; Yiwei Jiang 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 193 KB