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) vario...Daugiau...
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 suc...Daugiau...
(Išleidimo metai: 22-Feb-2014, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642427671)
Ši knyga nebeleidžiama, tačiau mes Jums pranešime naudoto egzemplioriaus kainą
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and sp...Daugiau...
(Išleidimo metai: 25-Apr-2012, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642278747)
This book offers a systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is typical of a fuzzy notion, the authors present a unifying classification of general classes of struc...Daugiau...
(Išleidimo metai: 13-Jan-2012, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642244872)
Ši knyga nebeleidžiama, tačiau mes Jums pranešime naudoto egzemplioriaus kainą
This comprehensive textbook on combinatorial optimization emphasizes theoretical results and algorithms with provably good performance, in contrast to heuristics. The text contains complete but concise proofs, and also provides numerous exercises and...Daugiau...
(Išleidimo metai: 06-Jan-2012, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642245077)
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...Daugiau...
(Išleidimo metai: 18-Nov-2009, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642039935)
This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. It serves also as a comprehensive presentation of the theory and application of mixed matrices....Daugiau...
(Išleidimo metai: 15-Dec-2009, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642039416)
What is the most uniform way of distributing n points in the unit square? How big is the irregularity necessarily present in any such distribution? This book is an accessible and lively introduction to the area of geometric discrepancy theory, wi...Daugiau...
(Išleidimo metai: 07-Dec-2009, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642042942)
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 phys...Daugiau...
(Išleidimo metai: 18-Oct-2007, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540718437)
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimiza...Daugiau...
(Išleidimo metai: 01-Jun-2004, CD-ROM, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540204565)
From the reviews:Schrijvers 3 volumes on combinatorial optimization reflect the current state of the art in this field, in particular from the viewpoint of polyhedral combinatorics and efficient algorithms. ( ...) The book offers a masterly introduc...Daugiau...
(Išleidimo metai: 10-Dec-2002, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540443896)
From the reviews: About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as the Lawler simply. I think that now, with this volume Springer has landed a coup: The Schrijver. The box is offered...Daugiau...
(Išleidimo metai: 28-Feb-2002, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540431541)
Ši knyga nebeleidžiama, tačiau mes Jums pranešime naudoto egzemplioriaus kainą
This comprehensive book on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep result...Daugiau...
(Išleidimo metai: 20-Jun-2001, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540416548)
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 a...Daugiau...
(Išleidimo metai: 18-Aug-1999, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540659419)
The topic of this book is finite group actions and their use in order to approach finite unlabeled structures by defining them as orbits of finite groups of sets. Well-known examples are graph, linear codes, chemical isomers, spin configurations, iso...Daugiau...
(Išleidimo metai: 18-Jun-1999, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540658337)
From the reviews: Do you know M.Padbergs Linear Optimization and Extensions? ( ) Now here is the continuation of it, discussing the solutions of all its exercises and with detailed analysis of the applications mentioned. Tell your students about...Daugiau...
Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed
Serija: Algorithms and Combinatorics
(Išleidimo metai: 19-Aug-1998, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540646228)
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...Daugiau...
(Išleidimo metai: 20-May-1997, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540616115)
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...Daugiau...
(Išleidimo metai: 31-Dec-1996, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540610311)
This is a comprehensive survey of the mathematical life of Paul Erdos, covering all the main areas of his research. The book contains both high-level research articles, as well as key articles, which survey some of the cornerstones of Erdos work,...Daugiau...
(Išleidimo metai: 31-Dec-1996, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540610328)
Ši knyga nebeleidžiama, tačiau mes Jums pranešime naudoto egzemplioriaus kainą
This is a comprehensive survey of the mathematical life of Paul Erdos, covering all the main areas of his research. The book contains both high-level research articles, as well as key articles, which survey some of the cornerstones of Erdos work,...Daugiau...
(Išleidimo metai: 15-Sep-1993, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540567400)
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather,...Daugiau...
(Išleidimo metai: 31-Dec-1991, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540181903)
Ši knyga nebeleidžiama, tačiau mes Jums pranešime naudoto egzemplioriaus kainą
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 ext...Daugiau...
(Išleidimo metai: 12-Dec-1990, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540181910)
One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theor...Daugiau...
Bernhard Korte, Laszlo Lovasz, Hans J. Promel, Alexander Schrijver
Serija: Algorithms and Combinatorics
(Išleidimo metai: 12-Dec-1990, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540526858)
VLSI (very large scale integration) is an excellent example for applications of discrete mathematics and combinatorial optimisation. This volume, with contributions by top researchers, demonstrates the liveliness of the area. VLSI (very large...Daugiau...
(Išleidimo metai: 30-Oct-1989, Hardback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540152859)
I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is,...Daugiau...
(Išleidimo metai: 01-Nov-1986, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540170969)
While the worst-case analysis of some variants of the method shows that this is not a good algorithm in the usual sense of complexity theory, it seems to be useful to apply other criteria for a judgement concerning the quality of the algorithm....Daugiau...
