Connections in Combinatorial Optimization

— —

András Frank (, MTA-ELTE Egerváry Research Group, Institute of Mathematics, Eötvös Loránd University, Budapest)

Connections in Combinatorial Optimization

András Frank (, MTA-ELTE Egerváry Research Group, Institute of Mathematics, Eötvös Loránd University, Budapest)

$324

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Oxford University Press
17 February 2011

Optimisation; Combinatorics & graph theory; Maths for computer scientists

Series: Oxford Lecture Series in Mathematics and Its Applications

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.

By: András Frank ( MTA-ELTE Egerváry Research Group Institute of Mathematics Eötvös Loránd University Budapest)
Imprint: Oxford University Press
Country of Publication: United Kingdom
Volume: 38
Dimensions: Height: 232mm, Width: 156mm, Spine: 41mm
Weight: 1g
ISBN: 9780199205271
ISBN 10: 0199205272
Series: Oxford Lecture Series in Mathematics and Its Applications
Pages: 664
Publication Date: 17 February 2011
Audience: College/higher education , Further / Higher Education
Format: Hardback
Publisher's Status: Active

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

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.

Reviews for Connections in Combinatorial Optimization

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