论文信息 - On the Kth best base of a matroid

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(K"4), W^3, Q"6 and P"6.

Brahim Chaourar

[1] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] James G. Oxley,et al. Matroid theory , 1992 .

[4] David K. Smith. Theory of Linear and Integer Programming , 1987 .

[5] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[6] Brahim Chaourar,et al. On Greedy Bases Packing in Matroids , 2002, Eur. J. Comb..