Výsledky vyhľadávania - "68q25 (theory of computing: analysis of algorithms AND problem complexity)"

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications.

Autori: Iwamasa, Yuni Takazawa, Kenjiro

Zdroj: Mathematical Programming. Jul2022, Vol. 194 Issue 1/2, p229-256. 28p.

Predmety: *MATROIDS, *COST functions, *COMBINATORIAL optimization, *MODULAR functions, *MATHEMATICAL programming, *CONVEX functions