- We will send in 10–14 business days.
/images/books/2901678/9780199205271.jpg)
- Author: András Frank
- Publisher: Academic
- ISBN-10: 0199205272
- ISBN-13: 9780199205271
- Format: 15 x 23.4 x 4.1 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.18:21:12
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: András Frank
- Publisher: Academic
- ISBN-10: 0199205272
- ISBN-13: 9780199205271
- Format: 15 x 23.4 x 4.1 cm, hardcover
- Language: English English
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.
Reviews