Combinatorial optimization

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.

שנה

1975

שפה

English

הוצאה

Oxford University Press, USA

מהדורות

2

עמודים

384

ISBN

9780030848667

מקור הנתונים: Wikidata