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

Algorithms in Combinatorial Geometry, Edelsbrunner Herbert



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

При оформлении заказа до: 19 июл 2022
Ориентировочная дата поставки: Август
При условии наличия книги у поставщика.

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

Автор: Edelsbrunner Herbert
Название:  Algorithms in Combinatorial Geometry
Перевод названия: Герберт Эдельсбрюннер: Алгоритмы в комбинаторной геометрии
ISBN: 9783642648731
Издательство: Springer
Классификация:
ISBN-10: 3642648738
Обложка/Формат: Paperback
Страницы: 423
Вес: 0.668 кг.
Дата издания: 23.09.2011
Язык: English
Размер: 234 x 156 x 23
Ссылка на Издательство: Link
Поставляется из: Германии



Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 14090 р.
Наличие на складе: Поставка под заказ.

Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

Efficient Algorithms for Listing Combinatorial Structures

Автор: Goldberg
Название: Efficient Algorithms for Listing Combinatorial Structures
ISBN: 0521117887 ISBN-13(EAN): 9780521117883
Издательство: Cambridge Academ
Рейтинг:
Цена: 4107 р.
Наличие на складе: Поставка под заказ.

Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating P??lya's cycle polynomial is demonstrated.

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 11549 р.
Наличие на складе: Поставка под заказ.

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

Combinatorial Algorithms

Автор: Jiri Fiala; Jan Kratochvil; Mirka Miller
Название: Combinatorial Algorithms
ISBN: 3642102166 ISBN-13(EAN): 9783642102165
Издательство: Springer
Рейтинг:
Цена: 10394 р.
Наличие на складе: Поставка под заказ.

Описание: The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.

Efficient Algorithms for Listing Combinatorial Structures

Автор: Goldberg
Название: Efficient Algorithms for Listing Combinatorial Structures
ISBN: 0521450217 ISBN-13(EAN): 9780521450218
Издательство: Cambridge Academ
Рейтинг:
Цена: 11367 р.
Наличие на складе: Поставка под заказ.

Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating P??lya's cycle polynomial is demonstrated.

Combinatorial Geometry and Graph Theory / Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers

Автор: Akiyama Jin, Baskoro Edy Tri, Kano Mikio
Название: Combinatorial Geometry and Graph Theory / Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers
ISBN: 3540244018 ISBN-13(EAN): 9783540244011
Издательство: Springer
Рейтинг:
Цена: 8084 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post-proceedings of the Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003, held in Bandung, Indonesia in September 2003.

Finite Geometry and Combinatorial Applications

Автор: Ball
Название: Finite Geometry and Combinatorial Applications
ISBN: 1107518431 ISBN-13(EAN): 9781107518438
Издательство: Cambridge Academ
Рейтинг:
Цена: 4655 р.
Наличие на складе: Поставка под заказ.

Описание: The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.

Branch-and-Bound Applications in Combinatorial Data Analysis

Автор: Brusco Michael, Stahl Stephanie
Название: Branch-and-Bound Applications in Combinatorial Data Analysis
ISBN: 0387250379 ISBN-13(EAN): 9780387250373
Издательство: Springer
Рейтинг:
Цена: 15014 р.
Наличие на складе: Поставка под заказ.

Описание: There are a variety of combinatorial optimization problems that are relevant to the examination of statistical data. Combinatorial problems arise in the clustering of a collection of objects, the seriation (sequencing or ordering) of objects, and the selection of variables for subsequent multivariate statistical analysis such as regression. The options for choosing a solution strategy in combinatorial data analysis can be overwhelming. Because some problems are too large or intractable for an optimal solution strategy, many researchers develop an over-reliance on heuristic methods to solve all combinatorial problems. However, with increasingly accessible computer power and ever-improving methodologies, optimal solution strategies have gained popularity for their ability to reduce unnecessary uncertainty. In this monograph, optimality is attained for nontrivially sized problems via the branch-and-bound paradigm.For many combinatorial problems, branch-and-bound approaches have been proposed and/or developed. However, until now, there has not been a single resource in statistical data analysis to summarize and illustrate available methods for applying the branch-and-bound process. This monograph provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, psuedocode, and well-developed examples for applications of the branch-and-bound paradigm to important problems in combinatorial data analysis. Supplementary material, such as computer programs, are provided on the world wide web.Dr. Brusco is a Professor of Marketing and Operations Research at Florida State University, an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America. Stephanie Stahl is an author and researcher with years of experience in writing, editing, and quantitative psychology research.

Graph Theory and Combinatorial Optimization

Автор: Avis David, Hertz Alain, Marcotte Odile
Название: Graph Theory and Combinatorial Optimization
ISBN: 0387255915 ISBN-13(EAN): 9780387255910
Издательство: Springer
Рейтинг:
Цена: 12704 р.
Наличие на складе: Поставка под заказ.

Описание: The techniques of graph theory have been used in solving many classical problems. This book explores the field`s classical foundations and its developing theories, ideas and applications to new problems. It also examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application.

Integer Programming and Combinatorial Optimization / 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings

Автор: Nemhauser George, Bienstock Daniel
Название: Integer Programming and Combinatorial Optimization / 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings
ISBN: 3540221131 ISBN-13(EAN): 9783540221135
Издательство: Springer
Рейтинг:
Цена: 10971 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2004, held in New York City, USA in June 2004.The 32 revised papers presented were carefully reviewed and selected from 109 submissions. Among the topics addressed are vehicle routing, network management, mixed-integer programming, computational complexity, game theory, supply chain management, stochastic optimization problems, production scheduling, graph computations, computational graph theory, separation algorithms, local search, linear optimization, integer programming, graph coloring, packing, combinatorial optimization, routing, flow algorithms, 0/1 polytopes, and polyhedra.

The Symmetric Group / Representations, Combinatorial Algorithms, and Symmetric Functions

Автор: Sagan Bruce E.
Название: The Symmetric Group / Representations, Combinatorial Algorithms, and Symmetric Functions
ISBN: 0387950672 ISBN-13(EAN): 9780387950679
Издательство: Springer
Рейтинг:
Цена: 5774 р.
Наличие на складе: Поставка под заказ.

Описание: This text is an introduction to the representation theory of the symmetric group from three different points of view: via general representation theory, via combinatorial algorithms, and via symmetric functions. It is the only book to deal with all three aspects of this subject at once. The style of presentation is relaxed yet rigorous and the prerequisites have been kept to a minimumВїundergraduate courses in linear algebra and group theory will suffice.

Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Автор: Bampis Evripidis, Jansen Klaus, Kenyon Claire
Название: Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications
ISBN: 3540322124 ISBN-13(EAN): 9783540322122
Издательство: Springer
Цена: 8661 р.
Наличие на складе: Поставка под заказ.

Описание: This book provides a good opportunity for computer science practitioners and researchers to get in sync with the current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.This state-of-the-art survey contains 11 carefully selected papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification.


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