论文信息 - An algorithm for finding a matroid basis which maximizes the product of the weights of the elements

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

Consider the problem of finding a spanning tree in an edge-weighted connected graph that maximizes the product of its edge weights, where negative edge weights are allowed. We generalize this problem to matroids and give a polynomial time algorithm for its solution.

Alan M. Frieze | Trevor I. Fenner | A. Frieze | T. Fenner

[1] R. Rado. Note on Independence Functions , 1957 .

[2] D. Gale. Optimal assignments in an ordered set: An application of matroid theory , 1968 .

[3] D. Welsh. Kruskal's theorem for matroids , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[5] Ramaswamy Chandrasekaran,et al. Minimal ratio spanning trees , 1977, Networks.

[6] Nimrod Megiddo. Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[7] Robert E. Tarjan,et al. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..

[8] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[9] Robert E. Tarjan,et al. Efficient Algorithms for a Family of Matroid Intersection Problems , 1984, J. Algorithms.