Combinatorial Optimization: Networks and Matroids
  Zoom

Combinatorial Optimization: Networks and Matroids

ISBN 13:  9780486414539

FREE Shipping on 3 books or more! - for all UK orders - find out more

Availability:  

Import stock, currently extended lead times to 2 - 3 weeks.  

Import stock, currently extended lead times to 2 - 3 weeks.

Author:  Lawler
Format:  Paperback
No. of Pages:  374
Brand:  Dover Publications

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Illustrations: -
Author: Lawler
Size: -
Format: Book
Copyright: -
ISBN 13: 9780486414539

Be the first to Write a Review for this item!

UK Delivery

Order 3 or more books to enjoy FREE UK delivery!

Method Cost for Single Book Additional Book
UK Standard £2.70 £0.80   *  Order 3 + books for FREE delivery
UK First Class £3.90 £2.00

Overseas

Method Cost for Delivery Plus Cost per Book
Europe (Standard Air via Royal Mail) £5.00 £1.50
Rest of World (Air Mail) £5.00 £5.00

In Stock items are sent same day (Monday to Friday before 3 pm) or within one working day.

Find out more in our full delivery and returns information