Approximation Algorithms /
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its cl...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2003.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Internet
Connect to the full text of this electronic bookAvailable Online
| Call Number: |
QA76.9.A43 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA76.9.A43 | Available | |