{ "item_title" : "Paradigms for Fast Parallel Approximability", "item_author" : [" Josep Diaz", "Maria Serna", "Paul Spirakis "], "item_description" : "This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems, such as flows, coverings, matchings, traveling salesman problems, and graphs. For added clarity, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is rounded off by an appendix that gives a convenient summary of the problems described in the book. This book is an up-to-date reference for research workers in the area of algorithms and for graduate courses in the subject.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/111/792/0521117925_b.jpg", "price_data" : { "retail_price" : "53.00", "online_price" : "53.00", "our_price" : "53.00", "club_price" : "53.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details