Combinatorial Algorithms, Zsuzsanna Lipt?k; William F. Smyth

Автор: Sung
Название: Algorithms in Bioinformatics
ISBN: 1420070339 ISBN-13(EAN): 9781420070330
Издательство: Taylor&Francis
Рейтинг:
Цена: 13779.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Presents an introduction to the algorithmic techniques applied in bioinformatics. For each topic, this title details the biological motivation, defines the corresponding computational problems, and includes examples to illustrate each algorithm.

Автор: Youssef Hamadi
Название: Combinatorial Search: From Algorithms to Systems
ISBN: 366251429X ISBN-13(EAN): 9783662514290
Издательство: Springer
Рейтинг:
Цена: 13275.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book details key techniques in constraint networks, dealing in particular with constraint satisfaction, search, satisfiability, and applications in machine learning and constraint programming. Includes case studies.

Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil
Название: Gems of Combinatorial Optimization and Graph Algorithms
ISBN: 3319249703 ISBN-13(EAN): 9783319249704
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.

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

Описание: 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. online algorithms; combinatorial algorithms; graph algorithms;

Автор: Kratochv?l Jan; Mirka Miller; Dalibor Froncek
Название: Combinatorial Algorithms
ISBN: 3319193147 ISBN-13(EAN): 9783319193144
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk.- On the Galois Lattice of Bipartite Distance Hereditary Graphs.- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance.- Border Correlations, Lattices and the Subgraph Component Polynomial.- Computing Minimum Length Representations of Sets of Words of Uniform Length.- Computing Primitively-Rooted Squares and Runs in Partial Words.- 3-coloring triangle-free planar graphs with a precolored 9-cycle.- Computing Heat Kernel Pagerank and a Local Clustering Algorithm.- Solving Matching Problems Efficiently in Bipartite Graphs.- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.- On decomposing the complete graph into the union of two disjoint cycles.- Reconfiguration of Vertex Covers in a Graph.- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory.- On Maximum Common Subgraph Problems in Series-Parallel Graphs.- Profile-based optimal matchings in the Student/Project Allocation Problem.- The Min-Max Edge q-Coloring Problem.- Speeding up Graph Algorithms via Switching Classes.- Metric Dimension for Amalgamations of Graphs.- Deterministic Algorithms for the Independent Feedback Vertex Set Problem.- Lossless seeds for searching short patterns with high error rates.

Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv
Название: Geometric Algorithms and Combinatorial Optimization
ISBN: 3642782426 ISBN-13(EAN): 9783642782428
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.

Автор: Gilbert Baumslag; Charles F. III Miller
Название: Algorithms and Classification in Combinatorial Group Theory
ISBN: 1461397324 ISBN-13(EAN): 9781461397328
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and Stallings. The organisers of the workshop were G. Baumslag, F.B. Cannonito and C.F. Miller III. The pa- pers in this volume are an outgrowth of lectures at this conference. The first three papers are concerned with decision problems and the next two with finitely presented simple groups. These are followed by two papers dealing with combinatorial geometry and homology. The remaining papers are about automatic groups and related topics. Some of these papers are, in essence, announcements of new results. The complexity of some of them are such that neither the Editors nor the Reviewers feel that they can take responsibility for vouching for the completeness of the proofs involved. We wish to thank the staff at MSRl for their help in organising the workshop and this volume.

Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi
Название: Combinatorial Optimization and Graph Algorithms
ISBN: 9811061467 ISBN-13(EAN): 9789811061462
Издательство: Springer
Рейтинг:
Цена: 15372.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.

Автор: Klaus Jansen; Samir Khuller
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540679960 ISBN-13(EAN): 9783540679967
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, randomization techniques, average-case analysis, scheduling problems, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

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

Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. 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.

Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540441867 ISBN-13(EAN): 9783540441861
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Compiled from the proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, this volume contains 20 revised full papers. Coverage includes design and analysis of approximation algorithms, inapproximability results and online problems.

Автор: Klaus Jansen; Jose Rolim
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540647368 ISBN-13(EAN): 9783540647362
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A volume of 17 papers from a workshop on approximation algorithms for combinatorial optimization. They address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, scheduling problems, and applications.