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.

About the Author
Andras Frank is the founder and head of the MTA-ELTE Egervary Research Group (EGRES) at Eoetvoes University. He was head of the Department of Operations Research at Eoetvoes University between 1995 and 2009. In 2002, he was awarded the Tibor Szele Prize by the Janos Bolyai Mathematical Society, and in 2009, the Cultural Ministry of Hungary awarded him the Szent-Gyorgyi Albert Prize.

Reviews
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 *



Book Information
ISBN 9780199205271
Author Andras Frank
Format Hardback
Page Count 664
Imprint Oxford University Press
Publisher Oxford University Press
Weight(grams) 1088g
Dimensions(mm) 232mm * 156mm * 41mm