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

On a class of algorithms for total approximation

โœ Scribed by G.A Watson

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
474 KB
Volume
45
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Approximation Algorithms for Hierarch
On Approximation Algorithms for Hierarchical MAX-SAT
โœ Sameet Agarwal; Anne Condon ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 232 KB

We prove upper and lower bounds on performance guarantees of approximation ลฝ . algorithms for the hierarchical MAX-SAT H-MAX-SAT problem. This problem is representative of a broad class of PSPACE-hard problems involving graphs, Boolean formulas, and other structures that are defined succinctly. Our

Approximation algorithms for minimizing
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
โœ Joseph Y-T. Leung; Haibing Li; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re