Search Results - "68Q25 (Theory of computing: Analysis of algorithms and problem complexity)"
-
1
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
ISSN: 0025-5610, 1436-4646Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022Published in Mathematical programming (01.07.2022)“…For two matroids M 1 and M 2 with the same ground set V and two cost functions w 1 and w 2 on 2 V , we consider the problem of finding bases X 1 of M 1 and X 2…”
Get full text
Journal Article