Combinatorial Search: From Algorithms to Systems, Youssef Hamadi
Автор: Youssef Hamadi Название: Combinatorial Search: From Algorithms to Systems ISBN: 3642414818 ISBN-13(EAN): 9783642414817 Издательство: Springer Рейтинг: Цена: 46570.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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.
Автор: M?kinen Название: Combinatorial Algorithms ISBN: 3319445421 ISBN-13(EAN): 9783319445427 Издательство: Springer Рейтинг: Цена: 61490.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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;
Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi Название: Combinatorial Optimization and Graph Algorithms ISBN: 9811061467 ISBN-13(EAN): 9789811061462 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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.
Автор: Kratochv?l Jan; Mirka Miller; Dalibor Froncek Название: Combinatorial Algorithms ISBN: 3319193147 ISBN-13(EAN): 9783319193144 Издательство: Springer Рейтинг: Цена: 52170.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
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.
Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil Название: Gems of Combinatorial Optimization and Graph Algorithms ISBN: 3319249703 ISBN-13(EAN): 9783319249704 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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.
Автор: Zsuzsanna Lipt?k; William F. Smyth Название: Combinatorial Algorithms ISBN: 3319295152 ISBN-13(EAN): 9783319295152 Издательство: Springer Рейтинг: Цена: 52170.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the thoroughly refereedpost-workshop proceedings for the 26 International Workshop on combinatorialAlgorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions.
Автор: Giorgio Ausiello; M. Lucertini Название: Analysis and Design of Algorithms in Combinatorial Optimization ISBN: 3211816267 ISBN-13(EAN): 9783211816264 Издательство: Springer Рейтинг: Цена: 81050.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani Название: Approximation Algorithms for Combinatorial Optimization ISBN: 3540441867 ISBN-13(EAN): 9783540441861 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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.
Автор: Edelsbrunner Название: Algorithms in combinatorial geometry ISBN: 354013722X ISBN-13(EAN): 9783540137221 Издательство: Springer Рейтинг: Цена: 121070.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.
Автор: Jiri Fiala; Jan Kratochvil; Mirka Miller Название: Combinatorial Algorithms ISBN: 3642102166 ISBN-13(EAN): 9783642102165 Издательство: Springer Рейтинг: Цена: 83850.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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.
Автор: M.S. Levin Название: Combinatorial Engineering of Decomposable Systems ISBN: 1461376734 ISBN-13(EAN): 9781461376736 Издательство: Springer Рейтинг: Цена: 139750.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
