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?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Marchetti-Spaccamela, Alberto - Contributor
- Crescenzi, Pierluigi - Contributor
- Gambosi, Giorgio - Contributor
- Protasi, Marco - Contributor
- Kann, Viggo - Contributor
Publication
1999 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
131,000 words, Guess
Page Count
524 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivecomplexityapprox00ausi_689
- ISBN-103642584128
- ISBN-139783642584121
- OCLC Control Number840292544
- Better World Books9783642584121
and 1 more
- Open LibraryOL27025495M
Classifications
- LCCQA75.5-76.95
Description
This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.
Subjects
Links
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!