{"version":"1.0","type":"link","title":"Matroid intersection - Newikis","description":"In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}