๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem

โœ Scribed by W. Ludwig

Book ID
112252131
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
397 KB
Volume
117
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Reliable Randomized Algorithm for the
A Reliable Randomized Algorithm for the Closest-Pair Problem
โœ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an ร„ 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C

A simple approximation algorithm for the
A simple approximation algorithm for the weighted matching problem
โœ Doratha E Drake; Stefan Hougardy ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [