BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for ... (Lecture Notes in Computer Science, 2129)

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for ... (Lecture Notes in Computer Science, 2129)

Approximation, Randomization and Combinatorial Optimization: Algorithms and
Stock photo: cover may vary

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for ... (Lecture Notes in Computer Science, 2129) Paperback - 2001 - 2001st Edition

by Goemans, Michel

Add to wish list
  • New
  • Paperback
New

Description

Springer, 2001-08-03. 2001. paperback. New. 6.10x0.71x9.25. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$99.17
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)
The BIBLIO Guarantee

Details

About Ergodebooks Texas, United States

Specialising in: Rare Books, Rare Dvd, Rare Video, Textbook
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.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for ... (Lecture Notes in Computer Science, 2129)

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

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

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Please wait a moment while we load the requested page.

tracking-