This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
📄 Viewing lite version
Full site ›
⌛ 🇫🇷 France pricing being fetched…
Prices will appear once fetched — usually within a few minutes.
View in:
🇺🇸 USA