Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Ausiello, Giorgio (Author)/ Crescenzi, Pierluigi (Author)/ Gambosi, Giorgio (Author)/ Kann, Viggo (Author)/ Marchetti-Spaccamela, Alberto (Author)/ Protasi, Marco (Author)

ISBN 10: 3642635814 / ISBN 13: 9783642635816

Verlag: Springer, 2013

Beschreibung

548 pages. 9.50x7.10x1.00 inches. In Stock.

Bestandsnummer des Verkäufers 3642635814

Bibliografische Details

• Titel: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
• Verlag: Springer
• Erscheinungsjahr: 2013
• Sprache: Englisch
• ISBN-10: 3642635814
• ISBN-13: 9783642635816
• Einband: Paperback
• Zustand: Brand New

Über diesen Titel

Inhaltsangabe

, the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers.

Reseña del editor

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.