Stock photo: cover may vary
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques Hardback - 2001 - 2001st Edition
by Goemans, Michel, Jansen, Klaus ; Rolim, Jose D.P ; Trevisan, Luca
- Used
- very good
- Hardback
A$27.07
A$7.94
Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Standard delivery: 7 to 14 days
Details
- Title Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques
- Author Goemans, Michel, Jansen, Klaus ; Rolim, Jose D.P ; Trevisan, Luca
- Binding Hardback
- Edition number 2001st
- Edition 2001
- Condition Used - Very good
- Pages 296
- Volumes 1
- Language ENG
- Publisher Springer Verlag, New York
- Publication date 2001
- Bookseller's Inventory # 010803
- ISBN 9783540424703 / 3540424709
- Weight 0.97 lbs (0.44 kg)
- Dimensions 9.21 x 6.14 x 0.65 in (23.39 x 15.60 x 1.65 cm)
- Size 8vo - over 7¾" - 9&f
- Category Computers - General Information
- Library of Congress Catalogue Number 2001049298
- Dewey Decimal Code 004.015
- Bookseller catalogues Computer
About Doss-Haus Books California, United States
Biblio member since 2004
We are a home-based bookseller. We do not have a retail location. We believe in customer service. We will wrap your book with care and mail it promptly. We answer all of our e-mails in a timely manner.
All orders placed with a credit card through Biblio's shopping cart will ship within 2 days of the order. Books purchased with Money orders, Cashiers checks or PayPal will be sent upon receipt of payment. All Personal checks will be held until cleared by the bank. We will send your book promptly when the check clears. If you require additional information about any of our books listed, please e-mail us. Please include "BOOK" in the subject line and your e-mail will be promptly returned. Any book may be returned in the same condition as sent within 7 days of receipt. Shipping costs are not refunded unless the book is not as described. Scans or digital photos available upon request.
Reader reviews for Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques
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
