Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
The Steiner Tree Problem
In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity.
Lectures on Proof Verification and Approximation Algorithms
This is a self-contained presentation of the enormous recent progress on the interplay between and applications of the theory of probabilistically checkable proofs and approximation algorithms.
Topics in Discrete Mathematics
This book comprises a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of Professor Jarik Nešetril. Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs, Homomorphisms, Graph Colorings and Graph Embeddings.
Reproducibility
2017 PROSE Award Honorable Mention The PROSE Awards draw attention to pioneering works of research and for contributions to the conception, production, and design of landmark works in their fields. Featuring peer-reviewed contributions from noted experts in their fields of research, Reproducibility: Principles, Problems, Practices, and Prospects presents state-of-the-art approaches to reproducibility, the gold standard of sound science, from multi- and interdisciplinary perspectives. Including comprehensive coverage for implementing and reflecting the norm of reproducibility in various pertinent fields of research, the book focuses on how the reproducibility of results is applied, how it may...
Randomization and Approximation Techniques in Computer Science
This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, held in Barcelona, Spain, in October 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. Also included are three invited contributions. Among the topics addressed are graph computation, derandomization, pattern matching, computational geometry, approximation algorithms, search algorithms, sorting, and networking algorithms.
STACS 2004
This book constitutes the refereed proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, held in Montpellier, France, in March 2004. The 54 revised full papers presented together with two invited contributions were carefully reviewed and selected from more than 200 submissions. The papers are organized in topical sections on structural complexity, graph algorithms, quantum computing, satisfiability - constraint satisfaction problems, scheduling, algorithms, networks, automata theory and words, path algorithms, cryptography, logic and formal languages, game theory and complexity, and algorithmic information.
Lectures on Proof Verification and Approximation Algorithms
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.
Building Bridges II
This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of László Lovász. The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization. László Lovász is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, “building bridges” between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years. The 14 contributions presented in this volume, all of which are connected to László Lovász's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.
Orders, Algorithms and Applications
This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recognized place in computer science as well as in mathematics, due to various new developments in the last few years. The nine technical papers accepted for this volume and the four invited papers presented offer a representative perspective on theoretical and applicational aspects of orders and related algorithms.
SOFSEM 2000: Theory and Practice of Informatics
The international conference on current trends in the theory and practice of informatics SOFSEM 2000 was held 25 November–2 December 2000 in the c- ference facilities of the Dev?et Skal (Nine Rocks) Hotel, Milovy, Czech-Moravian Highlands, the Czech Republic. It was already the 27th annual meeting in the series of SOFSEM conferences organized in either the Czech or the Slovak Rep- lic. Since its establishment in 1974, SOFSEM has gone through a long dev- opment in parallel with the entire ?eld of informatics. Currently SOFSEM is a wide-scope, multidisciplinary conference, with stress on the interplay between the theory and practice of informatics. The SOFSEM scienti?c program consists mainl...
