Výsledky vyhledávání - "68q25 (theory of computing: analysis of algorithms and problem complexity)"

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications Autor Iwamasa, Yuni, Takazawa, Kenjiro

“…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…”
Získat plný text