Combinatorial Optimization: Networks and Matroids - Eugene Lawler
-40% koodiga BOOKS
Saadetis 22-28 tööpäeva jooksul
30-päevane tagastamisõigus
Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
Kirjeldus
Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
Lisateave
| Autor | Eugene Lawler |
|---|---|
| Kirjastaja | Dover Publications |
| Väljalaskeaasta | 2011 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9780486414539 |