✦ LIBER ✦

On competitive on-line algorithms for the dynamic priority-ordering problem

✍ Scribed by G. Ramalingam; Thomas Reps

Book ID: 107766174
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 625 KB
Volume: 51
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00080-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-Line Algorithms for the Dynamic Trave

On-Line Algorithms for the Dynamic Traveling Repair Problem

✍ Sandy Irani; Xiangwen Lu; Amelia Regan 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 146 KB

On-line k-Truck Problem and Its Competit

On-line k-Truck Problem and Its Competitive Algorithms

✍ Weimin Ma; Yinfeng Xu; Kanliang Wang 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 87 KB

On-line algorithms for the dominating se

On-line algorithms for the dominating set problem

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

The competitiveness of randomized algori

The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems

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

Competitive Analysis for the On-line Tru

Competitive Analysis for the On-line Truck Transportation Problem

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

New On-Line Algorithms for the Page Repl

New On-Line Algorithms for the Page Replication Problem

✍ Susanne Albers; Hisashi Koga 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitive ratio can be given. We develop an optimal randomized on-line replication algorithm for trees and uniform networks; its