Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.
Автор: Naumann Название: Combinatorial Scientific Computing ISBN: 1439827354 ISBN-13(EAN): 9781439827352 Издательство: Taylor&Francis Рейтинг: Цена: 13860 р. Наличие на складе: Невозможна поставка.
Описание: Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.
Автор: Gregory Kucherov; Esko Ukkonen Название: Combinatorial Pattern Matching ISBN: 3642024408 ISBN-13(EAN): 9783642024405 Издательство: Springer Рейтинг: Цена: 7836 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 20th Annual Symposium CPM 2009 Lille France June 2224 2009 Proceedings. .
Автор: Petra Wiederhold; Reneta P. Barneva Название: Combinatorial Image Analysis ISBN: 3642102085 ISBN-13(EAN): 9783642102080 Издательство: Springer Рейтинг: Цена: 9404 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 13th International Workshop IWCIA 2009 Playa del Carmen Mexico November 2427 2009 Proceedings. .
Описание: This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009.
Автор: Boting Yang; Ding-Zhu Du; Cao An Wang Название: Combinatorial Optimization and Applications ISBN: 3540850961 ISBN-13(EAN): 9783540850960 Издательство: Springer Рейтинг: Цена: 9404 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St John`s, Canada, in August 2008. This book includes papers that feature research in the areas of combinatorial optimization - both theoretical issues and applications motivated by real-world problems.
Описание: This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems.
Автор: Goodman Название: Combinatorial and Computational Geometry ISBN: 0521178398 ISBN-13(EAN): 9780521178396 Издательство: Cambridge Academ Рейтинг: Цена: 5406 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This 2005 volume, which contains 32 papers on a broad range of topics of interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension. There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, as well as with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.
Описание: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
Автор: Paolo Ferragina; Gad M. Landau Название: Combinatorial Pattern Matching ISBN: 3540690662 ISBN-13(EAN): 9783540690665 Издательство: Springer Рейтинг: Цена: 7314 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. This book features 25 revised full papers which addresses various areas related to combinatorial pattern matching and its applications, such as coding and data compression, and computational biology.
Автор: Cook, W.j. Cunningham, William H. Pulleybank, W. R Название: Combinatorial optimization ISBN: 047155894X ISBN-13(EAN): 9780471558941 Издательство: Wiley Рейтинг: Цена: 18134 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorial optimization is a topic in discrete mathematics and theoretical computer science. This book covers the theory, algorithms and applications in a manner which should be accessible to researchers and post graduate students in mathematics and computer science.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru