Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Authors:
Giorgio Ausiello;Pierluigi Crescenzi;Giorgio Gambosi;Viggo Kann;Alberto Marchetti-Spaccamela;Marco Protasi
Affiliations:
-;-;-;-;-;-
Venue:
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Year:
2013

Citing 0
Cited 1

Computing the differential of a graph: Hardness, approximability and exact algorithms

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.