✦ LIBER ✦

On-line k-Truck Problem and Its Competitive Algorithms

✍ Scribed by Weimin Ma; Yinfeng Xu; Kanliang Wang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Competitive Analysis for the On-line Tru

✍ Weimin Ma; James N. K. Liu; Guoqing Chen; Jane You 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 118 KB

On competitive on-line algorithms for th

✍ G. Ramalingam; Thomas Reps 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 625 KB

The competitiveness of randomized algori

✍ Ying Teh Tsai; Chuan Yi Tang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 373 KB

On the competitive ratio of the work fun

✍ Yair Bartal; Elias Koutsoupias 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Branch-and-bound algorithms for simple a

✍ S. B. Liu; K. M. Ng; H. L. Ong 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 179 KB

Ordinal scheduling problem and its asymp

✍ Zhiyi Tan; Yong He 📂 Article 📅 2004 🏛 Science in China Press (SCP) 🌐 English ⚖ 137 KB