Optimal Assignments in Linear Programming
← Back to topic
Authors: Jack Edmonds
Year: 1973
Journal: JACM
DOI: 10.1145/321694.321699
Publisher: https://dl.acm.org/doi/10.1145/321694.321699
Keywords: edmonds, greedy
Abstract
We describe a greedy algorithm for the matroid intersection problem.
Cite this paper
bibtex
@misc{greedy1973,
title = {Optimal Assignments in Linear Programming},
author = {Jack Edmonds},
year = {1973},
journal = {JACM},
doi = {10.1145/321694.321699},
url = {https://doi.org/10.1145/321694.321699},
}