Autors:

CiteWeb id: 20130000078

CiteWeb score: 1790

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.

The publication "Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties" is placed in the Top 10000 in category Mathematics.
Links to full text of the publication: