Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Gebundene Ausgabe) von Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi   Kurzbeschreibung: 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. Lesen Sie mehr... Rezensionen ansehen...   Angebote zu  Complexity ,  Approximation ,  Combinatorial  ab 1 Euro! Siehe auch folgende Artikel: Approximation Algorithms. von Vijay V. Vazirani Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences) von Michael R. Garey Sonstige Artikel: Nocturnes. Klavier (Musiknoten) von Chopin Frederic Heaven von Cate Blanchett|Giovanni Ribisi Mehr zu  Computer Science,  Computers & Internet,  Algorithms,  Informatik,  Algorithmen,  Game Theory,  Algebra,  Reference,  Game Theory,  Mathematics,  Algebra Home ...,    Angebote ansehen ...,    Begleitseite ... Herausgeber dieser Seite ist DomainLoc.com GmbH - Partner von Amazon.de Copyright © DomainLoc.com GmbH (Impressum)