Share
combinatorial optimization: networks and matroids (in English)
Eugene Lawler
(Author)
·
Dover Publications
· Paperback
combinatorial optimization: networks and matroids (in English) - Lawler, Eugene
$ 17.47
$ 24.95
You save: $ 7.49
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Wednesday, May 22 and
Thursday, May 23.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "combinatorial optimization: networks and matroids (in English)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
