Dear customers, due to a public holiday, customer support is not available today. We will attend to your requests the next business day. Thank you for your understanding.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Dear customers, due to a public holiday, customer support is not available today. We will attend to your requests the next business day. Thank you for your understanding.

Connections in Combinatorial Optimization

Name: Connections in Combinatorial Optimization
Brand: Oxford University Press
SKU: 04529415
Price: 185.89 EUR
Availability: InStock
Author: Andras Frank
ISBN: 9780199205271

Andras Frank

Language

English

Book Hardback

Libristo code: 04529415

Publishers Oxford University Press, February 2011

Graph connectivities and submodular functions are two widely applied and fast developing fields of c... Full description

Libristo code: 04529415

455 b

185.89 € VAT included

In stock at our supplier Shipping in 10-18 days

Delivery to Austria

30-day return policy

Customers also purchased

Rinaldo Rinaldini, der Rauberhauptmann Christian August Vulpius

Paperback

38.69 €

A Televis?o, o Digital e a Cultura Participativa Francisco Rui Cadima

Paperback

17.79 €

Berlin. Portrait of a City Hans Christian Adam

Hardback

60.00 €

Dictionnaire international Bourdieu

Paperback

48.69 €

CONDUCTOR DE SINDRIES, EL - CATALA EMILIO URBERUAGA (ILUSTR.)

Hardback

16.89 €

Die Bedeutung des Bergbaus in der Weltwirtschaft und in der Weltpolitik. Ferdinand Friedensburg

Paperback

19.59 €

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.