Submodular Functions And Electrical Networks Annals Of Discrete Mathematics Volume 54
Download Submodular Functions And Electrical Networks Annals Of Discrete Mathematics Volume 54 PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Submodular Functions And Electrical Networks Annals Of Discrete Mathematics Volume 54 book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Submodular Functions and Electrical Networks. Annals of Discrete Mathematics, Volume 54
There is a strong case for electrical network topologists and submodular function theorists being aware of each other's fields. Presenting a topological approach to electrical network theory, this text demonstrates the strong links that exist between submodular functions and electrical networks. The book contains:a detailed discussion of graphs, matroids, vector spaces and the algebra of generalized minors; relevant to network analysis (particularly to the construction of efficient circuit simulators); and a detailed discussion of submodular function theory in its own right. Topics covered inc.
Discrete Geometry and Optimization
Author: Károly Bezdek
language: en
Publisher: Springer Science & Business Media
Release Date: 2013-07-09
Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.
FST TCS 2000: Foundations of Software Technology and Theoretical Science
Author: Sanjiv Kapoor
language: en
Publisher: Springer Science & Business Media
Release Date: 2000-11-29
This book constitutes the refereed proceedings of the 20th international Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000, held in New Delhi, India in December 2000. The 36 revised full papers presented were carefully reviewed and selected from a total of 141 submissions; also included are six invited papers. The volume provides broad coverage of the logical and mathematical foundations of computer science and spans the whole range of theoretical computer science.