Efficient solution of the matroid product problem

Authors:
Dan Gusfield
Affiliations:
College of Engineering, Department of Electrical Engineering and Computer Science, University of California, Davis, CA 95616, USA
Venue:
Operations Research Letters
Year:
1989

Citing 3
Cited 0

An algorithm for finding a matroid basis which maximizes the product of the weights of the elements

BIT
On-line updating of solutions to a class of matroid intersection problems

Information and Computation
Forests, frames, and games: algorithms for matroid sums and applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The matroid product problem is to find a base of a matroid which maximizes the product of the weights of the elements in the base, where element weights can be negative as well as positive. In this paper we connect the problem to the more general matroid selection problem, and use general theorems about the selection problem to efficiently solve the matroid product problem.