𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum and Worst-Case Performance Ratios of Rollout Algorithms

✍ Scribed by Luca Bertazzi

Publisher
Springer
Year
2011
Tongue
English
Weight
638 KB
Volume
152
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Worst-case performance of critical path
Worst-case performance of critical path type algorithms
✍ G. Singh; Y. Zinder πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 343 KB

The critical path method remains one of the most popular approaches in practical scheduling. Being developed for the makespan problem this method can also be generalized to the maximum lateness problem. For the unit execution time task system and parallel processors this generalization is known as t

Worst-case performance of approximation
Worst-case performance of approximation algorithms for tool management problems
✍ Yves Crama; Joris van de Klundert πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 2 views

Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to b

Worst-case ratios of networks in the rec
Worst-case ratios of networks in the rectilinear plane
✍ Ulrich Brenner; Jens Vygen πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 231 KB

## Abstract For point sets in the rectilinear plane, we consider the following five measures of the interconnect length and prove bounds on the worst‐case ratio: minimum Steiner tree, minimum star, clique, minimum spanning tree, and bounding box. In particular, we prove that, for any set of __n__ p