# Combinatorial optimization: networks and matroids

“Combinatorial optimization: networks and matroids” (2021), by Eugene L. Lawler. Computer Science research paper. Original abstract below, unchanged. No free PDF was found.

- Authors: Eugene L. Lawler
- Published: August 16, 2021
- Field: Computer Science
- Source: https://openalex.org/W2125690626

## Abstract

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 and concrete computational complexity in departments of computer science and mathematics.

Canonical page: https://nerdi.pages.dev/paper/W2125690626
Read three real papers a day in Nerdi (iPhone): https://apps.apple.com/app/apple-store/id6813826387?pt=128757794&ct=web-paper&mt=8