Name: approximation algorithms for combinatorial optimization
Price: 1892.00 TWD
Availability: InStock
ISBN: 9783540679967

Select your country

Americas

Europe

Rest of the world

portada approximation algorithms for combinatorial optimization

approximation algorithms for combinatorial optimization

Type

Physical Book

Publisher

Springer

Language

English

Pages

275

ISBN

3540679960

ISBN13

9783540679967

Synopsis "approximation algorithms for combinatorial optimization"

this book constitutes the refereed proceedings of the third international workshop on approximation algorithms for combinatorial optimization problems, approx 2000, held in saarbrücken, germany in september 2000. the 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. the topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

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