Нравится LibRing?
Расскажи друзьям:
G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. Spaccamela

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Книгу можно купить в интернет-магазинах:

· OZON.ru 12915р. [Проверить наличие]
ISBN: 3540654313
Издательство: Springer-Verlag
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.