Xiaodong hu (36 Ergebnisse)

hardcover. Zustand: Very Good.

hardcover. Zustand: Fine.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New.

Zustand: New. In.

Paperback. Zustand: Brand New. 413 pages. 9.26x6.10x0.79 inches. In Stock.

Zustand: New. pp. 416.

Zustand: New. In.

Zustand: New. In.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: Brand New. 440 pages. 9.25x6.25x1.25 inches. In Stock.

Zustand: New. pp. xiii + 359 Illus.

Paperback. Zustand: Brand New. 413 pages. 9.26x6.10x0.79 inches. In Stock.

Hardcover. Zustand: Brand New. 413 pages. 9.25x6.10x1.14 inches. In Stock.

Zustand: New. In.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way. When exact solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. Even so, there are very few textbooks available for this course. Among those available in the market, most follow a problem-oriented format which is perhaps more convenient for researchers. This text follows a more structured, technique-oriented presentation. Approximation algorithms are organized into different chapters based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature, together. The structure of the text guides the reader to better understanding of the design and analysis techniques for approximation algorithms, and also helps the instructor to present the ideas and techniques of these algorithms in a more unified way.This textbook is intended for graduate students studying theoretical computer science. It can also be used as a reference work for researchers in the area of design and analysis of approximation algorithms. …

Zustand: New. Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published .

Zustand: Used. pp. 700 Illus.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, suchas greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook. …

Zustand: Used. pp. 700.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, suchas greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.…

Zustand: Hervorragend. Zustand: Hervorragend | Seiten: 452 | Sprache: Englisch | Produktart: Bücher | This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.…

Taschenbuch. Zustand: Neu. Computing and Combinatorics | 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings | Xiaodong Hu (u. a.) | Taschenbuch | xiv | Englisch | 2008 | Springer | EAN 9783540697329 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Paperback. Zustand: Brand New. 2008 edition. 677 pages. 9.00x6.00x1.00 inches. In Stock.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 700 | Sprache: Englisch | Produktart: Bücher | The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.…

Zustand: New.

Zustand: New.