Combinatorial Optimization

副标题: Networks and Matroids

ISBN: 9780486414539

出版社: Dover Publications

出版年: 2001-03-02

页数: 374

定价: USD 15.95

装帧: Paperback

内容简介

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.