If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
Help
If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
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 uptodate reference for research workers in the area of algorithms and for graduate courses in the subject.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer,
birth defects, or other reproductive harm.
I picked up this book, part of the Cambridge International Series, to help me better understand parallel computation. The theories presented are clear and well-structured. It’s a bit dense, but definitely worth the dive if you're interested in this area.
L
Liam Chen
Great resource for computational theory
I picked up this book, part of the Cambridge International Series, to help me better understand parallel computation. The theories presented are clear and well-structured. It’s a bit dense, but definitely worth the dive if you're interested in this area.
L
Liam Chen
Great resource for computational theory
I picked up this book, part of the Cambridge International Series, to help me better understand parallel computation. The theories presented are clear and well-structured. It’s a bit dense, but definitely worth the dive if you're interested in this area.
R
Riya Patel
Could use more examples
I appreciate the rigorous approach of this book on parallel computation, but I wish there were more practical examples to illustrate the concepts. It’s somewhat theoretical, which can be intimidating at times. But it’s still a solid addition to my library.
R
Riya Patel
Could use more examples
I appreciate the rigorous approach of this book on parallel computation, but I wish there were more practical examples to illustrate the concepts. It’s somewhat theoretical, which can be intimidating at times. But it’s still a solid addition to my library.
For MAP (Minimum Advertised Price) violations and Intellectual Property (IP) or Trademark concerns, please contact:
support@ergodebooks.com
⚠️ California Proposition 65 Warning: Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm. For more information, visit www.P65Warnings.ca.gov.
