你好! Tracked shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approx
Type
Physical Book
Publisher
Year
2014
Language
English
Pages
316
Format
Paperback
Dimensions
23.40 x 15.60 x 1.60 cm
ISBN13
9783662187197

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approx

Michel Goemans;Klaus Jansen;Jose D.p. Rolim (Author) · Springer · Paperback

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approx - Michel Goemans;Klaus Jansen;Jose D.P. Rolim

Cheaper New Book Imported to Taiwan
Delivery: 01 Sep - 14 Sep Shipping: 11 to 15 business days.
NT$ 2,070
Faster New Book Imported to Taiwan
Delivery: 20 Aug - 28 Aug Shipping: 4 to 5 business days.
NT$ 2,148
NT$ 2,070

Synopsis "Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approx"

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.

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews