Data & IT
Approximative Algorithmen und Nichtapproximierbarkeit
Klaus Jansen • Marian Margraf
Inbunden
889:-
Uppskattad leveranstid 7-11 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Inbunden
- ISBN: 9783110203165
- Språk: Engelska
- Antal sidor: 516
- Utgivningsdatum: 2008-04-01
- Förlag: De Gruyter