Geometric folding algorithms, Erik D. Demaine

Автор: Demaine, Erik D. O`rourke, Joseph
Название: Geometric folding algorithms
ISBN: 0521715229 ISBN-13(EAN): 9780521715225
Издательство: Cambridge Academ
Рейтинг:
Цена: 4883 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Emphasizing algorithmic and computational aspects, this fascinating treatment of the geometry of folding and unfolding presents hundreds of results and over 60 open problems. Aimed at advanced undergraduates and graduates in mathematics or computer science, this lavishly illustrated book will entertain a broad audience, from school students to researchers.

Автор: Haga Kazuo Et Al
Название: Origamics: Mathematical Explorations Through Paper Folding
ISBN: 9812834893 ISBN-13(EAN): 9789812834898
Издательство: World Scientific Publishing
Рейтинг:
Цена: 8052 р.
Наличие на складе: Невозможна поставка.

Описание: The art of origami, or paper folding, is carried out using a square piece of paper to obtain attractive figures of animals, flowers or other familiar figures. This book considers origami an object of mathematical exploration. It provides a useful, alternative approach for reinforcing and applying the theorems of high school mathematics.

Автор: G?rtner, Matousek
Название: Approximation Algorithms and Semidefinite Programming
ISBN: 3642220142 ISBN-13(EAN): 9783642220142
Издательство: Springer
Рейтинг:
Цена: 8384 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.