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

An approximation algorithm for state minimization in 2-MDFAs

โœ Scribed by K. Subramani; C. Tauras


Publisher
Springer
Year
2006
Tongue
English
Weight
157 KB
Volume
18
Category
Article
ISSN
0934-5043

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Efficient Approximation Algorithm for
โœ Chandra Chekuri; Michael Bender ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 107 KB

We give a new and efficient approximation algorithm for scheduling precedenceconstrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j /s i units of time