✦ LIBER ✦

An Optimal On-Line Algorithm for K Servers on Trees

✍ Scribed by Chrobak, Marek; Larmore, Lawrence L.

Book ID: 118177278
Publisher: Society for Industrial and Applied Mathematics
Year: 1991
Tongue: English
Weight: 695 KB
Volume: 20
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0220008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for preemptive on-l

An optimal algorithm for preemptive on-line scheduling

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 286 KB

A Randomized Algorithm for Two Servers o

A Randomized Algorithm for Two Servers on the Line

✍ Yair Bartal; Marek Chrobak; Lawrence L Larmore 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 238 KB

An optimal algorithm for the on-line clo

An optimal algorithm for the on-line closest-pair problem

✍ C. Schwarz; M. Smid; J. Snoeyink 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 712 KB

On-line algorithm for optimal 3D path pl

On-line algorithm for optimal 3D path planning

✍ Chien-Wan Hun; Hun-Chen Chen; Ming-Fung Hwang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 927 KB

The issues of automatic car operation aiming at in an unknown complex terrain are the most effective path planning and the obstacles avoiding in this complex terrain. For that, an on-line algorithm for guiding a mobile object in an unexplored terrain filled with convex polygonal obstacles is present

An optimal pram algorithm for a spanning

An optimal pram algorithm for a spanning tree on trapezoid graphs

✍ Debashis Bera; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 143 KB

An optimal group testing algorithm on k

An optimal group testing algorithm on k disjoint sets

✍ J.F Weng; F.K Hwang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 143 KB