A Fast Approximation for Maximum Weight Matroid Intersection

We present an approximation algorithm for the maximum weight matroid intersection problem in the independence oracle model. Given two matroids defined over a common ground set N of n elements, let k be the rank of the matroid intersection and let Q denote the cost of an independence query for either matroid. An exact algorithm for finding a maximum cardinality independent set (the unweighted case), due

• Type: Journal
• Year: 2016
• Where: SODA
• Authors: Chandra Chekuri, Kent Quanrud
• Keywords: Algorithms, SODA 2016