Approximative Algorithmen und Nichtapproximierbarkeit (eBook, PDF) - Jansen, Klaus; Margraf, Marian
51,95 €
51,95 €
inkl. MwSt.
Sofort per Download lieferbar
Versandkostenfrei*
0 °P sammeln
51,95 €
51,95 €
inkl. MwSt.
Sofort per Download lieferbar
Versandkostenfrei*

Alle Infos zum eBook verschenken
0 °P sammeln
Als Download kaufen
51,95 €
inkl. MwSt.
Sofort per Download lieferbar
0 °P sammeln
Jetzt verschenken
51,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
0 °P sammeln
  • Format: PDF


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.…mehr

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

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

  • Produktdetails
  • Verlag: Gruyter, Walter de GmbH
  • Erscheinungstermin: 27. August 2008
  • Deutsch
  • ISBN-13: 9783110203172
  • Artikelnr.: 44456121
Autorenporträt


Klaus Jansen und Marian Markgraf, Universität Kiel.