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

Efficient Algorithms for Listing Combinatorial Structures, Goldberg



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

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

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

Автор: Goldberg
Название:  Efficient Algorithms for Listing Combinatorial Structures
ISBN: 9780521117883
Издательство: Cambridge Academ
Классификация:
ISBN-10: 0521117887
Обложка/Формат: Paperback
Страницы: 180
Вес: 0.3 кг.
Дата издания: 30.07.2009
Серия: Algorithmics, complexity, computer algebra, computational geometry
Язык: English
Иллюстрации: Black & white illustrations
Размер: 244 x 170 x 10
Читательская аудитория: Professional & vocational
Ссылка на Издательство: 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.

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

Автор: M?kinen
Название: Combinatorial Algorithms
ISBN: 3319445421 ISBN-13(EAN): 9783319445427
Издательство: Springer
Рейтинг:
Цена: 7623 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.

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.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Автор: Irit Dinur; Klaus Jansen; Seffi Naor; Jos? Rolim
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3642036848 ISBN-13(EAN): 9783642036842
Издательство: Springer
Рейтинг:
Цена: 15014 р.
Наличие на складе: Поставка под заказ.

Описание: 12th International Workshop APPROX 2009 and 13th International Workshop RANDOM 2009 Berkeley CA USA. .

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Автор: Ashish Goel; Klaus Jansen; Jos? Rolim; Ronitt Rubi
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540853626 ISBN-13(EAN): 9783540853626
Издательство: Springer
Рейтинг:
Цена: 12126 р.
Наличие на складе: Поставка под заказ.

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

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.

Evolutionary Computation in Combinatorial Optimization

Автор: Carlos Cotta; Peter I. Cowling
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3642010083 ISBN-13(EAN): 9783642010088
Издательство: Springer
Рейтинг:
Цена: 8084 р.
Наличие на складе: Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tubingen, Germany, in April 2009. This work contains papers that discuss developments and applications in metaheuristics.

Combinatorial Techniques

Автор: Sane Sharad S
Название: Combinatorial Techniques
ISBN: 9380250487 ISBN-13(EAN): 9789380250489
Издательство: Eurospan
Рейтинг:
Цена: 9663 р.
Наличие на складе: Невозможна поставка.

Описание: This is a basic text on combinatorics that deals with all the three aspects of the discipline: tricks, techniques and theory, and attempts to blend them.<br><br> The book has several distinctive features. Probability and random variables with their interconnections to permutations are discussed. The theme of parity has been specially included and it covers applications ranging from solving the Nim game to the quadratic reciprocity law. Chapters related to geometry include triangulations and Sperner's theorem, classification of regular polytopes, tilings and an introduction to the Eulcidean Ramsey theory. Material on group actions covers Sylow theory, automorphism groups and a classification of finite subgroups of orthogonal groups. <br><br> All chapters have a large number of exercises with varying degrees of difficulty, ranging from material suitable for Mathematical Olympiads to research.

Probabilistic Methods in Combinatorial Analysis

Автор: Sachkov
Название: Probabilistic Methods in Combinatorial Analysis
ISBN: 0521172772 ISBN-13(EAN): 9780521172776
Издательство: Cambridge Academ
Рейтинг:
Цена: 5887 р.
Наличие на складе: Поставка под заказ.

Описание: This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate.

Combinatorial Pattern Matching / 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings

Автор: Lewenstein Moshe, Valiente Gabriel
Название: Combinatorial Pattern Matching / 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings
ISBN: 3540354557 ISBN-13(EAN): 9783540354550
Издательство: Springer
Рейтинг:
Цена: 10047 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006, held in Barcelona, Spain in July 2006.The 33 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 88 submissions. The papers are organized in topical sections on data structures, indexing data structures, probabilistic and algebraic techniques, applications in molecular biology, string matching, data compression, and dynamic programming.

Combinatorial Image Analysis / 10th International Workshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings

Автор: Klette Reinhard, Zunic Jovisa
Название: Combinatorial Image Analysis / 10th International Workshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings
ISBN: 3540239421 ISBN-13(EAN): 9783540239420
Издательство: Springer
Рейтинг:
Цена: 15014 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 10th International Workshop on Combinatorial Image Analysis, IWCIA 2004, held in Auckland, New Zealand, in December 2004.The 55 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on discrete tomography, combinatorics and computational models, combinatorial algorithms, combinatorial mathematics, digital topology, digital geometry, approximation of digital sets by curves and surfaces, algebraic approaches, fuzzy image analysis, image segmentation, matching and recognition.


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