Connections in Combinatorial Optimization

Andras Frank

A unified treatment of the development of ideas and methods of the area

Richly illustrates how concrete results naturally give rise to the introduction of abstract notions and how results concerning these notions can be applied in special cases to get more sophisticated concrete results

Difficult theorems and algorithms are made accessible and easily digestible

Demonstrates several surprising connections between diverse topics of combinatorial optimization, such as connectivity issues of networks and submodular optimization

Includes the most up to date results from the field

Connections in Combinatorial Optimization

1

Andras Frank

Description

Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. Connections in Combinatorial Optimization 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.

Connections in Combinatorial Optimization

Andras Frank

Author Information

Andras Frank is the founder and head of the MTA-ELTE Egervary Research Group (EGRES) at Eotvos University. He was head of the Department of Operations Research at Eotvos University between 2005 and 2009. In 2002, he was awarded the Tibor Szele Prize by the Janos Bolyai Mathematical Society.

Connections in Combinatorial Optimization

1

Andras Frank

Reviews and Awards

"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