Stock photo: cover may vary
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th ... (Lecture Notes in Computer Science, 6845) Paperback - 2011 - 2011th Edition
by Goldberg, Leslie Ann
- Used
- Paperback
A$14.04
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 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th ... (Lecture Notes in Computer Science, 6845)
- Author Goldberg, Leslie Ann
- Binding Paperback
- Edition number 2011th
- Edition 2011
- Condition Used: Good
- Pages 702
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2011-08-05
- Illustrated Yes
- Features Bibliography, Illustrated, Index, Table of Contents
- Bookseller's Inventory # SONG3642229344
- ISBN 9783642229343 / 3642229344
- Weight 2.4 lbs (1.09 kg)
- Dimensions 9.2 x 6.1 x 1.4 in (23.37 x 15.49 x 3.56 cm)
- Size 6.10x1.63x9.25
- Category Computers - General Information
- Dewey Decimal Code 004.015
- Quantity available 1
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 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th ... (Lecture Notes in Computer Science, 6845)
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
From the publisher
From the rear cover
This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011.
The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.
APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.
APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
