Approximation Algorithms for Complex Systems, Emmanuil H Georgoulis; Armin Iske; Jeremy Levesley

Автор: G?rtner, Matousek
Название: Approximation Algorithms and Semidefinite Programming
ISBN: 3642220142 ISBN-13(EAN): 9783642220142
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.  There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

Автор: Trefethen
Название: Approximation Theory and Approximation Practice
ISBN: 1611972396 ISBN-13(EAN): 9781611972399
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 55440.00 T
Наличие на складе: Невозможна поставка.
Описание: In a book that will appeal to beginners and experts alike, Oxford University’s Nick Trefethen presents approximation theory using a fresh approach for this established field.Approximation Theory and Approximation Practice is a textbook on classical polynomial and rational approximation theory for the twenty-first century. It uses MATLAB? to teach the field’s most important ideas and results and differs fundamentally from other works on approximation theory in a number of ways: its emphasis is on topics close to numerical algorithms; concepts are illustrated with Chebfun; and each chapter is a PUBLISHable Matlab M-file, available online.In addition, the book centers on theorems and methods for analytic functions, which appear so often in applications, rather than on functions at the edge of discontinuity with their seductive theoretical challenges. Original sources are cited rather than textbooks, and each item in the bibliography is accompanied by an editorial comment.Each chapter has a collection of exercises, which span a wide range from mathematical theory to Chebfun-based numerical experimentation.

Автор: Evripidis Bampis; Klaus Jansen
Название: Approximation and Online Algorithms
ISBN: 3642124496 ISBN-13(EAN): 9783642124495
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event.

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.

Автор: Anastassiou George A
Название: Frontiers In Approximation Theory
ISBN: 9814696080 ISBN-13(EAN): 9789814696081
Издательство: World Scientific Publishing
Рейтинг:
Цена: 92930.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

This monograph presents the author's work of the last five years in approximation theory. The chapters are self-contained and can be read independently. Readers will find the topics covered are diverse and advanced courses can be taught out of this book.

The first part of the book is dedicated to fractional monotone approximation theory introduced for the first time by the author, taking the related ordinary theory of usual differentiation at the fractional differentiation level with polynomials and splines as approximators. The second part deals with the approximation by discrete singular operators of the Favard style, for example, of the Picard and Gauss-Weierstrass types. Then, it continues in a very detailed and extensive chapter on approximation by interpolating operators induced by neural networks, a connection to computer science. This book ends with the approximation theory and functional analysis on time scales, a very modern topic, detailing all the pros and cons of this method.

The results in this book are expected to find applications in many areas of pure and applied mathematics. So far, very little is written about fractional approximation theory which is at its infancy. As such, it is suitable for researchers, graduate students, and performing seminars as well as an invaluable resource for all science libraries.