Title
Approximation Algorithms For Nphard Problems
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
This Is The First Book To Fully Address The Study Of Approximation Algorithms As A Tool For Coping With Intractable Problems. With Chapters Contributed By Leading Researchers In The Field, This Book Introduces Unifying Techniques In The Analysis Of Approximation Algorithms.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What are the dimensions of this book? A: The book measures six point seventy-five inches in length, zero point seventy-five inches in width, and nine point seventy-six inches in height.
- Q: How many pages does this book have? A: This book contains six hundred twenty-four pages, providing an in-depth exploration of approximation algorithms.
- Q: What type of binding does this book have? A: This book is bound in hardcover, ensuring durability and a professional appearance.
- Q: Who is the author of this book? A: The author of this book is Dorit Hochbaum, a leading researcher in the field of approximation algorithms.
- Q: What category does this book fall under? A: This book is categorized under Computer Science, specifically focusing on approximation algorithms.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for readers with a basic understanding of computer science and algorithms.
- Q: Can this book be used as a textbook for a course? A: Yes, it can be used as a textbook for courses on algorithms and computer science.
- Q: What is the reading level for this book? A: The reading level is appropriate for advanced undergraduate students and graduate students in computer science.
- Q: Is this book still relevant for current studies in algorithms? A: Yes, the book addresses fundamental techniques that are still applicable to current research in algorithms.
- Q: How do I store this book to keep it in good condition? A: Store this book upright on a shelf in a cool, dry place to prevent damage and maintain its condition.
- Q: What should I do if the book arrives damaged? A: If the book arrives damaged, contact the seller for a return or exchange as per their return policy.
- Q: Can I clean the cover of this book? A: Yes, you can clean the hardcover with a damp cloth, but avoid using abrasive cleaners.
- Q: Is there a warranty on this book? A: Typically, books do not come with a warranty, but return policies may apply if there are defects.
- Q: What if I have questions about the content of this book? A: You can refer to academic forums or reach out to the author for clarification on the content.
- Q: Is this book suitable for self-study? A: Yes, it is suitable for self-study, especially for those interested in algorithms and computational theory.