Design and Analysis of Approximation Algorithms
When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms. There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, e…
Mehr
CHF 115.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V106:
Fremdlagertitel. Lieferzeit unbestimmt
Produktdetails
Weitere Autoren: Ko, Ker-I / Hu, Xiaodong
- ISBN: 978-1-4614-1700-2
- EAN: 9781461417002
- Produktnummer: 11828395
- Verlag: Springer-Verlag New York Inc.
- Sprache: Englisch
- Erscheinungsjahr: 2011
- Seitenangabe: 440 S.
- Masse: H24.0 cm x B16.1 cm x D2.9 cm 806 g
- Auflage: 2012
- Abbildungen: XII, 440 p.
- Gewicht: 806
- Sonstiges: Professional & Vocational
Über den Autor
Ding-Zhu Du is co-editor of the first and soon-to-be published, second editions, of the Handbook of Combinatorial Optimization. He was also co-author with P.M. Pardalos and W. Wu of the Kluwer publication Mathematical Theory of Optimization. Du will co-author upcoming Springer publications (2012) entitled Connected Dominating Set: Theory and Applications and Introduction to Combinatorial Optimization. Prof. Du is also the EiC of the Journal of Combinatorial Optimization (Springer).Ker-I Ko is a well known expert in the field of theoretical computer science. He has authored a single publication with Birkhauser Computational Complexity of Real Functions in 1991, with very good reviews. Prof. Du and Ker-I Ko have written several texts together including Problem Solving in Automata, Languages, and Complexity John Wiley, 2001; Theory of Computational Complexity, John Wiley, 2000; Both of these books have received good reviews.Xiaodong Hu is an expert in combinatorial optimization. He is a member of the editorial boards of Journal of Combinatorial Optimization and Discrete Mathematics, Algorithms and Applications.
76 weitere Werke von Ding-Zhu Du:
Bewertungen
Anmelden