On the Kth best base of a matroid


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(K4), W3, Q6 and P6. © 2007 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.orl.2007.05.007
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Chaourar2008OnTK, title={On the Kth best base of a matroid}, author={Brahim Chaourar}, journal={Oper. Res. Lett.}, year={2008}, volume={36}, pages={239-242} }