Approximative Algorithmen und Nichtapproximierbarkeit (German, Hardcover, illustrated edition)

The subject matter of this textbook is the treatment of difficult to solve discrete optimisation problems. The first part presents fast algorithms which can provide approximate solutions to such problems. The second part deals with complexity theory and the non-approximability of optimisation problems. In addition, this textbook contains numerous application examples, exercises, illustrations and sections on the basics such as the Turing machine.

General

Imprint:	De Gruyter
Country of origin:	Germany
Series:	de Gruyter Lehrbuch
Release date:	April 2008
First published:	April 2008
Authors:	Klaus Jansen • Marian Margraf
Dimensions:	244 x 170 x 29mm (L x W x T)
Format:	Hardcover - Sewn / Cloth over boards
Pages:	516
Edition:	illustrated edition
ISBN-13:	978-3-11-020316-5
Languages:	German
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures
LSN:	3-11-020316-2
Barcode:	9783110203165

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!