Combinatorial Optimization antebellum North

antebellum North

mathematical space

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

Corrected reprint of the original edition

Fisher Unwin

Combinatorial Optimization antebellum NorthPerceptively 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