G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. Spaccamela

Complexity and approximation

combinatorial optimization problems and their approximability properties

Our rough guess is there are 131,000 words in this book.

At a pace averaging 250 words per minute, this book will take 8 hours and 44 minutes to read. With a half hour per day, this will take 18 days to read.

How long will it take you?

Enter your reading speed

You can take one of our WPM reading speed tests to find your reading speed.

Get it on Amazon Buy on Bookshop.org

We earn a commission on purchases

Author

Contributions

Ausiello, G. 1941- - Contributor

Publication

1999 - Springer, New York, New York (State)

Language

English

Word Count

131,000 words, Guess

Page Count

524 pages

Identifiers

ISBN-103540654313
ISBN-139783540654315
Library of Congress Control Number99040936
OCLC Control Number41967185
Open LibraryOL15520594M

Classifications

LCCQA402.5 .C555 1999

Subjects

Topics

Computers Game Theory Optimization Combinatorics Reference works Algebra - General Computer algorithms

Other Editions

Complexity and approximationSpringer1999

Similar Books

Introduction to Algorithms

Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, Charles E. Leiserson

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!