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.
Komentáře
Přihlas se, abys mohl/a přidat komentář.
Zatím žádné komentáře. Buď první!