Combinatorial Optimization: Networks and Matroids Heather Russell Around 2005

Around 2005

Armchair fiction presents extra large paperback editions of the best in classic science fiction novels

Diana publishes in the larger size book as she doesn't like squinting at a recipe book while cooking and doesn't think you should have to do so either

Times and Measurements

Combinatorial Optimization: Networks and Matroids Heather Russell Around 2005Perceptively 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