Stock photo: cover may vary
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Paperback - 1998
by Papadimitriou, Christos H
- New
- Paperback
A$37.71
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Standard delivery: 5 to 10 days
Dropship order
Ships from Ergodebooks (Texas, United States)
Details
- Title Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
- Author Papadimitriou, Christos H
- Binding Paperback
- Edition Unabridged
- Condition New
- Pages 528
- Volumes 1
- Language ENG
- Publisher Dover Publications, Mineola, New York, U.S.A.
- Publication date 1998-01-29
- Bookseller's Inventory # DADAX0486402584
- ISBN 9780486402581 / 0486402584
- Weight 1.17 lbs (0.53 kg)
- Dimensions 8.47 x 5.48 x 1.04 in (21.51 x 13.92 x 2.64 cm)
- Size 5.50x1.25x8.50
- Category Mathematics
- Library of Congress subjects Mathematical optimization, Computational complexity
- Library of Congress Catalogue Number 98021476
- Dewey Decimal Code 519
- Quantity available 6
About Ergodebooks Texas, United States
Biblio member since 2005
Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.
We have 30 day return policy.
Reader reviews for Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
