Overview

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.

Full Product Details

Author:   András Frank (, MTA-ELTE Egerváry Research Group, Institute of Mathematics, Eötvös Loránd University, Budapest)
Publisher:   Oxford University Press
Imprint:   Oxford University Press
Volume:   38
Dimensions:   Width: 15.60cm , Height: 4.10cm , Length: 23.20cm
Weight:   1.088kg
ISBN:  

9780199205271

ISBN 10:   0199205272
Pages:   664
Publication Date:   24 February 2011
Audience:   College/higher education ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   To order  
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Table of Contents

Preface PART I - Basic Combinatorial Optimization 1: Elements of graphs and hypergraphs 2: Connectivity, paths, and matchings 3: Elements of network optimization 4: Elements of polyhedral combinatorics 5: Elements of matroid theory PART II - Higher-Order Connections 6: Efficient algorithms for flows and cuts 7: Structure and representations of cuts 8: The splitting off operation and constructive characterizations 9: Orientations of graphs and hypergraphs 10: Trees and arborescences: packing and covering 11: Preserving and improving connections PART III - Semimodular Optimization 12: Setting the stage: aspects and approaches 13: Matroid optimization 14: Generalized polymatroids 15: Relaxing semimodularity 16: Submodular flows 17: Covering supermodular functions by digraphs Solutions to selected problems Bibliography Index

Reviews

<br> 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. -- MathematicalReviews<p><br>

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

Author Information

András Frank is the founder and head of the MTA-ELTE Egerváry Research Group (EGRES) at Eötvös University. He was head of the Department of Operations Research at Eötvös University between 1995 and 2009. In 2002, he was awarded the Tibor Szele Prize by the János Bolyai Mathematical Society, and in 2009, the Cultural Ministry of Hungary awarded him the Szent-Gyorgyi Albert Prize.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions