Algorithms and Combinatorics – serie
Visar alla böcker i serien Algorithms and Combinatorics. Handla med fri frakt och snabb leverans.
43 produkter
Optimal Interconnection Trees in the Plane
Theory, Algorithms and Applications
Av Marcus Brazil, Martin Zachariasen
Inbunden, 2015
551 kr
Lägg i varukorg
This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood …
Optimal Interconnection Trees in the Plane
Theory, Algorithms and Applications
Av Marcus Brazil, Martin Zachariasen
Häftad, 2016
551 kr
Lägg i varukorg
This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood …
Combinatorics and Complexity of Partition Functions
Inbunden, 2017
1425 kr
Lägg i varukorg
Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, …
Combinatorics and Complexity of Partition Functions
Häftad, 2018
1425 kr
Lägg i varukorg
Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, …
Discrete and Computational Geometry
The Goodman-Pollack Festschrift
Av Boris Aronov, Saugata Basu m. fl.
2003
1937 kr
Lägg i varukorg
An impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the 'founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The …
Simplex Method
A Probabilistic Analysis
Häftad, 1986
551 kr
Lägg i varukorg
For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear programming problems. It is proba bly that mathematical algorithm for which the most computation time on computers is spent. This fact explains the great interest of …
Systems Analysis by Graphs and Matroids
Structural Solvability and Controllability
Av Kazuo Murota
Häftad, 1987
1098 kr
Lägg i varukorg
Recent technology involves large-scale physical or engineering systems consisting of thousands of interconnected elementary units. This monograph illustrates how engineering problems can be solved using the recent results of combinatorial mathematics through appropriate mathematical modeling. The …
Greedoids
Inbunden, 1991
989 kr
Lägg i varukorg
This monograph attempts to unify different mathematical approaches and to lead the reader from fundamental results in matroid theory to the current state-of-the-art in open research problems. It reviews classical concepts from matroid theory and extends them to greedoids ("greedy" algorithms).
Topics in Discrete Mathematics
Dedicated to Jarik Nešetril on the Occasion of his 60th birthday
Av Martin Klazar, Jan Kratochvil m. fl.
Inbunden, 2006
1643 kr
Lägg i varukorg
The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday ofProfessor Jarik Nešetril. Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, …
Strange Logic of Random Graphs
Av Joel Spencer
Inbunden, 2001
1098 kr
Lägg i varukorg
The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the …
Graph Colouring and the Probabilistic Method
Inbunden, 2001
1580 kr
Lägg i varukorg
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.The topics covered …
Combinatorial Optimization
Polyhedra and Efficiency
2002
1809 kr
Lägg i varukorg
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 …
Irregularities of Partitions
Häftad, 1989
551 kr
Lägg i varukorg
The problem of uniform distribution of sequences initiated by Hardy, Little wood and Weyl in the 1910's has now become an important part of number theory. This is also true, in relation to combinatorics, of what is called Ramsey theory, a theory of about the same age going back to Schur. Both …
Geometry of Cuts and Metrics
Av Michel Marie Deza, Monique Laurent
Inbunden, 1997
1643 kr
Lägg i varukorg
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc.This book presents a wealth of …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Michel Habib, Colin McDiarmid m. fl.
Inbunden, 1998
1098 kr
Lägg i varukorg
Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random …
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Inbunden, 1998
1467 kr
Lägg i varukorg
You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a …
Geometric Discrepancy
An Illustrated Guide
Inbunden, 1999
1643 kr
Lägg i varukorg
Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the "most uniform" way of dis tributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? For a precise formulation of …
Linear Optimization and Extensions
Inbunden, 1999
1098 kr
Lägg i varukorg
I was pleasantly surprised when I was asked by Springer-Verlag to prepare a second edition of this volume on Linear Optimization and Extensions, which - not exactly contrary to my personal expectations - has apparently been accepted reasonably weIl by the global optimization community. My objective …
Applied Finite Group Actions
Inbunden, 1999
1643 kr
Lägg i varukorg
Also the present second edition of this book is an introduction to the theory of clas sification, enumeration, construction and generation of finite unlabeled structures in mathematics and sciences. Since the publication of the first edition in 1991 the constructive theory of un labeled finite …
Matrices and Matroids for Systems Analysis
Av Kazuo Murota
Inbunden, 1999
1970 kr
Lägg i varukorg
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.This book serves also as a comprehensive presentation of the …
Geometric Discrepancy
An Illustrated Guide
Häftad, 2009
1643 kr
Lägg i varukorg
Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the "most uniform" way of dis tributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? For a precise formulation of …
Matrices and Matroids for Systems Analysis
Av Kazuo Murota
Häftad, 2009
1534 kr
Lägg i varukorg
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.This book serves also as a comprehensive presentation of the …
Geometry of Cuts and Metrics
Av Michel Marie Deza, Monique Laurent
Häftad, 2009
1643 kr
Lägg i varukorg
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc.This book presents a wealth of …
Topics in Discrete Mathematics
Dedicated to Jarik Nešetril on the Occasion of his 60th birthday
Av Martin Klazar, Jan Kratochvil m. fl.
Häftad, 2010
1643 kr
Lägg i varukorg
The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday ofProfessor Jarik Nešetril. Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, …
Strange Logic of Random Graphs
Av Joel Spencer
Häftad, 2010
1098 kr
Lägg i varukorg
The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Michel Habib, Colin McDiarmid m. fl.
Häftad, 2010
1098 kr
Lägg i varukorg
Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random …
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Häftad, 2010
1425 kr
Lägg i varukorg
You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a …
Linear Optimization and Extensions
Häftad, 2010
1207 kr
Lägg i varukorg
I was pleasantly surprised when I was asked by Springer-Verlag to prepare a second edition of this volume on Linear Optimization and Extensions, which - not exactly contrary to my personal expectations - has apparently been accepted reasonably weIl by the global optimization community. My objective …
Applied Finite Group Actions
Häftad, 2010
1643 kr
Lägg i varukorg
Also the present second edition of this book is an introduction to the theory of clas sification, enumeration, construction and generation of finite unlabeled structures in mathematics and sciences. Since the publication of the first edition in 1991 the constructive theory of un labeled finite …
Boolean Function Complexity
Advances and Frontiers
Av Stasys Jukna
Inbunden, 2012
1207 kr
Lägg i varukorg
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that …
