Complexity and Approximation

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.

שנה

1999

שפה

English

הוצאה

Springer Berlin Heidelberg

מהדורות

1

עמודים

524

ISBN

9783642584121

מקור הנתונים: Wikidata