On the Kth best base of a matroid

Authors:
Brahim Chaourar
Affiliations:
Riyadh College of Technology, P.O. Box 42826, Riyadh 11551, Saudi Arabia
Venue:
Operations Research Letters
Year:
2008

Citing 3
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On greedy bases packing in matroids

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a weighted matroid M and a positive integer K, the Kth best base of M problem is to find K distinct minimum (or maximum) bases regarding the weight function. This problem is NP-hard. We prove that it is polynomial for 2-sums of uniform matroids and a fixed number of k-sums of series parallel graphs, M(K"4), W^3, Q"6 and P"6.