Cover Image

Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties /

Show other versions (1)

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 w...

Full description

Bibliographic Details
Main Author: Ausiello, G. (Giorgio), 1941-
Corporate Author: SpringerLink (Online service)
Other Authors: Marchetti-Spaccamela, Alberto, Crescenzi, Pierluigi, Gambosi, Giorgio, Protasi, Marco, Kann, Viggo
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999.
Subjects:
Computer science.
Computer software.
Electronic data processing.
Computational complexity.
Computer science > Mathematics.
Management information systems.
Electronic books.
Online Access:Connect to the full text of this electronic book
Description
Summary: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.
Item Description:Electronic resource.
Physical Description:1 online resource (XIX, 524 pages 69 illustrations)
ISBN:9783642584121 (electronic bk.)
3642584128 (electronic bk.)