✦ LIBER ✦

Scheduling with conflicts: online and offline algorithms

✍ Scribed by Guy Even; Magnús M. Halldórsson; Lotem Kaplan; Dana Ron

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Obtaining online approximation algorithm

✍ Daniel J. Rosenkrantz; Giri K. Tayi; S.S. Ravi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

Online and Offline Algorithms for the Ti

✍ Björn Brodén; Mikael Hammar; Brengt J. Nilsson 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 306 KB

Preemptive online algorithms for schedul

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

Semi-Online Algorithms for Scheduling wi

✍ Yi-Wei Jiang; Yong He 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 287 KB

Optimal semi-online algorithm for schedu

✍ Xiao Min; Jing Liu; Yuqing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 358 KB

Separating online scheduling algorithms

✍ Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 560 KB