Valuated matroid intersection .1. Optimality criteria
Valuated matroid intersection .1. Optimality criteria
复制标题
DOI:
10.1137/s0895480195279994
复制
发表时间:
1996-11-01
影响因子:
0.8
通讯作者:
Murota, K
中科院分区:
文献类型:
--
作者:
Murota, K
The independent assignment problem (or the weighted matroid intersection problem) is extended using Dress and Wenzel's matroid valuations, which are attached to the vertex set of the underlying bipartite graph as an additional weighting. Specifically, the problem considered is as follows: given a bipartite graph G = (V+,V-;A) with are weight w : A --> R and matroid valuations omega(+) and omega(-) on V+ and V-, respectively, find a matching M(subset of or equal to A) that maximizes Sigma{w(a) \ a is an element of M} + omega(+)(partial derivative(+) M) + omega(-)(partial derivative(-) M), where partial derivative(+) M and partial derivative(-) M denote the sets of vertices in V+ and V- incident to M. As natural extensions of the previous results for the independent assignment problem, two optimality criteria are established: one in terms of potentials and the other in terms of negative cycles in an auxiliary graph.