Combinatorial Optimization Networks And Matroids

By Nicole Fassbinder. 2016

620 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Convergent Learning: Do different neural networks learn the same representations? (2015, methodology): “This type of assignment is known as a bipartite semi-matching in graph theory (Lawler, 1976), and we adopt the same nomenclature here.”
The Algorithm Design Manual (2020, methodology): “Expositions on exact algorithms for Steiner trees in graphs include [Law76].”
Submodular Maximization with Cardinality Constraints (2014, background): “Matroids capture many natural collections of subsets such as: forests in graphs, independent sets in vector spaces and the sets of nodes that appear together in legal matchings of a given graph [47, 39].”