Parallel Algorithms For Knapsack Type Problems
| By: | V. N. Alexandrov; G. M. Megson |
| Publisher: | World Scientific Publishing |
| Print ISBN: | 9789810221201 |
| eText ISBN: | 9789812817518 |
| Edition: | 0 |
| Format: | Page Fidelity |
Lifetime - $55.20
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
Details
Table of Contents
This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.