Combinatorial optimization

The outer archives are busy

About this book

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.

Match Score

Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.

Create free account

Marks of the Realm

Marks left by readers of this tome

No community marks yet — be the first to inscribe this tome.

Pacing

—out of 5

Horror / Dark Elements

—out of 5

Romance

—out of 5

Spice Level

—out of 5

LGBTQ+ Representation

—out of 5

Social & Political Themes in Stories

—out of 5

Inscribe Your Rating

Mark this tome across each content category