Authors:
- Comprehensive Assessment of numerous problems in combinatorial optimization
- Includes supplementary material: sn.pub/extras
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (10 chapters)
-
Front Matter
-
Back Matter
About this book
Authors and Affiliations
-
Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Rome, Italy
Giorgio Ausiello, Alberto Marchetti-Spaccamela
-
Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Florence, Italy
Pierluigi Crescenzi
-
Dipartimento di Matematica, Università di Roma “Tor Vergata”, Rome, Italy
Giorgio Gambosi, Marco Protasi
-
NADA, Department of Numerical Analysis and Computing Science, KTH, Royal Institute of Technology, Stockholm, Sweden
Viggo Kann
Bibliographic Information
Book Title: Complexity and Approximation
Book Subtitle: Combinatorial Optimization Problems and Their Approximability Properties
Authors: Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann
DOI: https://doi.org/10.1007/978-3-642-58412-1
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1999
Hardcover ISBN: 978-3-540-65431-5Published: 09 November 1999
Softcover ISBN: 978-3-642-63581-6Published: 03 October 2013
eBook ISBN: 978-3-642-58412-1Published: 06 December 2012
Edition Number: 1
Number of Pages: XX, 524
Topics: Programming Techniques, Algorithm Analysis and Problem Complexity, Computational Mathematics and Numerical Analysis, Discrete Mathematics in Computer Science, Operations Research/Decision Theory, IT in Business