DownloadThe Portobello Bookshop Gift Guide 2024

Connections in Combinatorial Optimization

András Frank author

Format:Hardback

Publisher:Oxford University Press

Published:24th Feb '11

Currently unavailable, and unfortunately no date known when it will be back

Connections in Combinatorial Optimization cover

Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. This book not only includes the most recent results, but also highlights several surprising connections between diverse topics within combinatorial optimization. It offers a unified treatment of developments in the concepts and algorithmic methods of the area, starting from basic results on graphs, matroids and polyhedral combinatorics, through the advanced topics of connectivity issues of graphs and networks, to the abstract theory and applications of submodular optimization. Difficult theorems and algorithms are made accessible to graduate students in mathematics, computer science, operations research, informatics and communication. The book is not only a rich source of elegant material for an advanced course in combinatorial optimization, but it also serves as a reference for established researchers by providing efficient tools for applied areas like infocommunication, electric networks and structural rigidity.

The title of the book is wisely chosen: it deals, among other subjects, with graph connectivity, and it provides connections between graph theoretical results and underlying combinatorial structures...The book is readable for students, researchers, possibly also practitioners. * Mathematical Reviews *

ISBN: 9780199205271

Dimensions: 232mm x 156mm x 41mm

Weight: 1088g

664 pages