RO  EN
IMCS/Publications/BASM/Issues/BASM n.1 (7), 1992/

An approximation algorithm for matroids with coalitions. (English)

Authors: Zelikovsky A. Z.

Abstract

Given a family $P$ of pairwise disjoint independent sets (called coalitions) in a matroid $M=(X,I,d)$ with independence system $I$ and additivec weith function $d:2^X\Rightarrow R^+$, let $d_p:2^X \Rightarrow R^+$ be a weitht function such that $d_p|_X=d|_X$ and for any $A\subseteq X$, $d_p(A)=\Sigma \{d_p(\pi ) | \pi \in A_p\}+ d(A\setminus U\{\pi |\pi \in A_p\})\le d(A)$, where $A_p=\{\pi | \pi \le A\varepsilon \pi \in P\}$. We represent an approximation algorithm for the $NP$-hard problem of finding a minimum weitht base in a matroid with coalitions.