Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Cертификаты | Хиты | | |
 

Approximation and Online Algorithms / Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers, Erlebach Thomas, Persiano Giuseppe



Варианты приобретения
Цена: 8661р.
Кол-во:
 о цене
Наличие: Отсутствует. Возможна поставка под заказ.

При оформлении заказа до: 30 авг 2022
Ориентировочная дата поставки: конец Сентября- начало Октября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Erlebach Thomas, Persiano Giuseppe
Название:  Approximation and Online Algorithms / Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers
ISBN: 9783540322078
Издательство: Springer
Классификация:
ISBN-10: 3540322078
Обложка/Формат: Paperback
Страницы: 349
Вес: 1.13 кг.
Дата издания: 2006
Серия: Lecture notes in computer science / theoretical computer science and general issues
Язык: English
Иллюстрации: 1, black & white illustrations
Размер: 23.39 x 15.60 x 1.91
Читательская аудитория: Professional & vocational
Подзаголовок: Third international workshop, waoa 2005, palma de mallorca, spain, october 6-7, 2005, revised selected papers
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Дополнительное описание: Формат: 235x155
Круг читателей: Researchers and professionals
Ключевые слова: algorithm analysis
algorithm design
algorithmics
approximation algorithms
combinatorial graph theory
discrete mathematics
geometric algorithms
graph algorithms
graph drawing
network algorithms
online algorithms
parallel algorithms
randomized algorithms
scheduling
Язык: eng





Approximation Theory and Optimization

Автор: Buhmann
Название: Approximation Theory and Optimization
ISBN: 0521118441 ISBN-13(EAN): 9780521118446
Издательство: Cambridge Academ
Рейтинг:
Цена: 5203 р.
Наличие на складе: Поставка под заказ.

Описание: Authorities in numerical analysis and optimisation combine to write an important volume in the area.

Exact Constants in Approximation Theory

Автор: Korneichuk
Название: Exact Constants in Approximation Theory
ISBN: 0521111560 ISBN-13(EAN): 9780521111560
Издательство: Cambridge Academ
Рейтинг:
Цена: 6846 р.
Наличие на складе: Поставка под заказ.

Описание: A self-contained introduction for non-specialists, or a reference work for experts, on the area of approximation theory concerned with exact constants.

Du et al., Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications 62)

Название: Du et al., Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications 62)
ISBN: 1461417007 ISBN-13(EAN): 9781461417002
Издательство: Springer
Рейтинг:
Цена: 9239 р.
Наличие на складе: Поставка под заказ.

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

Approximation Theory and Approximation Practice

Автор: Trefethen
Название: Approximation Theory and Approximation Practice
ISBN: 1611972396 ISBN-13(EAN): 9781611972399
Издательство: Eurospan
Рейтинг:
Цена: 8053 р.
Наличие на складе: Невозможна поставка.

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

Advanced Problems in Constructive Approximation / 3rd International Dortmund Meeting on Approximation Theory (IDoMAT) 2001

Автор: Buhmann Martin D., Mache Detlef
Название: Advanced Problems in Constructive Approximation / 3rd International Dortmund Meeting on Approximation Theory (IDoMAT) 2001
ISBN: 3764366486 ISBN-13(EAN): 9783764366483
Издательство: Springer
Рейтинг:
Цена: 13281 р.
Наличие на складе: Поставка под заказ.

Описание: This volume contains refereed articles originating from the 3rd International Dortmund Meeting on Approximation Theory in Witten-Bommerholz. The contributors are renowned international experts in their individual fields of research, including, in particular, approximation methods, orthogonal polynomials, radial basis functions, multivariate spline approximation and interpolation, Pade approximation, polynomial approximation, and quasi-interpolation.

Approximation Algorithms

Автор: Vazirani Vijay V.
Название: Approximation Algorithms
ISBN: 3540653678 ISBN-13(EAN): 9783540653677
Издательство: Springer
Рейтинг:
Цена: 8084 р.
Наличие на складе: Поставка под заказ.

Описание: This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.Richard Karp,University Professor, University of California at BerkeleyFollowing the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.LГЎszlГі LovГЎsz, Senior Researcher, Microsoft Research

On L1-Approximation

Автор: Pinkus
Название: On L1-Approximation
ISBN: 0521057698 ISBN-13(EAN): 9780521057691
Издательство: Cambridge Academ
Рейтинг:
Цена: 5477 р.
Наличие на складе: Поставка под заказ.

Описание: This monograph is concerned with the qualitative theory of best L1-approximation from finite-dimensional subspaces.

Scattered Data Approximation

Автор: Wendland
Название: Scattered Data Approximation
ISBN: 0521131014 ISBN-13(EAN): 9780521131018
Издательство: Cambridge Academ
Рейтинг:
Цена: 7531 р.
Наличие на складе: Поставка под заказ.

Описание: Many practical applications require the reconstruction of a multivariate function from discrete, unstructured data. This book gives a self-contained, complete introduction into this subject. It concentrates on truly meshless methods such as radial basis functions, moving least squares, and partitions of unity. The book starts with an overview on typical applications of scattered data approximation, coming from surface reconstruction, fluid-structure interaction, and the numerical solution of partial differential equations. It then leads the reader from basic properties to the current state of research, addressing all important issues, such as existence, uniqueness, approximation properties, numerical stability, and efficient implementation. Each chapter ends with a section giving information on the historical background and hints for further reading. Complete proofs are included, making this perfectly suited for graduate courses on multivariate approximation and it can be used to support courses in computer-aided geometric design, and meshless methods for partial differential equations.

Greedy Approximation

Автор: Temlyakov
Название: Greedy Approximation
ISBN: 1107003377 ISBN-13(EAN): 9781107003378
Издательство: Cambridge Academ
Рейтинг:
Цена: 7942 р.
Наличие на складе: Поставка под заказ.

Описание: Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results, as well as the latest advances.

Approximation Algorithms and Semidefinite Programming

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

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

Numerical Approximation Methods

Автор: Cohen
Название: Numerical Approximation Methods
ISBN: 1441998365 ISBN-13(EAN): 9781441998361
Издательство: Springer
Цена: 9239 р.
Наличие на складе: Поставка под заказ.

Описание: This book presents numerical and other approximation techniques for solving various types of mathematical problems that cannot be solved analytically. In addition to well known methods, it contains some non-standard approximation techniques that are now formally collected as well as original methods developed by the author that do not appear in the literature.This book contains an extensive treatment of approximate solutions to various types of integral equations, a topic that is not often discussed in detail. There are detailed analyses of ordinary and partial differential equations and descriptions of methods for estimating the values of integrals that are presented in a level of detail that will suggest techniques that will be useful for developing methods for approximating solutions to problems outside of this text.The book is intended for researchers who must approximate solutions to problems that cannot be solved analytically. It is also appropriate for students taking courses in numerical approximation techniques.

The Design of Approximation Algorithms

Автор: Williamson
Название: The Design of Approximation Algorithms
ISBN: 0521195276 ISBN-13(EAN): 9780521195270
Издательство: Cambridge Academ
Рейтинг:
Цена: 7668 р.
Наличие на складе: Поставка под заказ.

Описание: Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия