Combinatorial Optimization root cutters

root cutters

it is because I have stood on the shoulders of giants

Fisher Unwin

illustrated children stories

The first volume begins with an outline of laminar and turbulent flow

Combinatorial Optimization root cuttersPerceptively 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