Get Free Shipping on orders over $89
Combinatorial Optimization : Networks and Matroids - Eugene Lawler

Combinatorial Optimization

Networks and Matroids

By: Eugene Lawler

eBook | 18 September 2012 | Edition Number 1

At a Glance

eBook


RRP $38.51

$30.90

20%OFF

or 4 interest-free payments of $7.72 with

 or 

Instant Digital Delivery to your Kobo Reader App

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.

on

More in Combinatorics & Graph Theory

Linear Algebraic Monoids - Lex E. Renner

eTEXT