This item combinatorial optimization networks and matroids dover books on mathematics by eugene lawler paperback 2074 only 5 left in stock more on the way ships from and sold by amazoncom. Reprints a work originally published by holt rinehart and winston new york 1976 focusing on combinatorial optimization problems involving matroids this text is suitable for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. 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. Combinatorial optimization networks and matroids dover books on mathematics ships from saint louis missouri shows wear from consistent use but it remains in good condition and works perfectly cover may have edge wear creases or bends
How it works:
1. Register a Free 1 month Trial Account.
2. Download as many books as you like ( Personal use )
3. No Commitment. Cancel anytime.
4. Join Over 100.000 Happy Readers.
5. That's it. What you waiting for? Sign Up and Get Your Books.