Skip to main content
SpringerLink
Log in

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

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Chandrasekaran,Minimum ratio spanning trees, Networks 7 (1977) 335–342.

    Google Scholar 

  2. J. Edmonds,Matroids and the greedy algorithm, Mathematical Programming 1 (1971) 127–136.

    Article  Google Scholar 

  3. M. L. Fredman and R. E. Tarjan,Fibonacci heaps and their uses in improved network optimization algorithms, Proceedings of 25th Annual IEEE Symposium on Foundations of Computer Science (1984) 338–346.

  4. H. N. Gabow and R. E. Tarjan,Efficient algorithms for a family of matroid intersection problems, Journal of Algorithms 5 (1984) 80–131.

    Article  Google Scholar 

  5. D. Gale,Optimal assignments in an ordered set: an application of matroid theory, Journal of Combinatorial Theory 4 (1968) 176–180.

    Google Scholar 

  6. E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York (1976).

    Google Scholar 

  7. N. Megiddo,Combinatorial optimization with rational objective functions, Mathematics of Operations Research 4 (1979) 414–424.

    Google Scholar 

  8. R. Rado,Note on independence functions, Proceedings of the London Mathematical Society 7 (1957) 300–320.

    Google Scholar 

  9. R. E. Tarjan,Sensitivity analysis of minimum spanning trees and shortest path trees, Information Processing Letters 14 (1982) 30–33.

    Article  Google Scholar 

  10. D. J. A. Welsh,Kruskal's algorithm for matroids, Proceedings of the Cambridge Philosophical Society 64 (1968) 3–4.

    Google Scholar 

  11. D. J. A. Welsh,Matroid Theory, Academic Press, London (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Birkbeck College, University of London, Malet Street, WC1E 7HX, London, England

    T. I. Fenner & A. M. Frieze

  2. Department of Computer Science and Statistics, Queen Mary College, University of London, E1 4NS, London, England

    T. I. Fenner & A. M. Frieze

Authors
  1. T. I. Fenner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fenner, T.I., Frieze, A.M. An algorithm for finding a matroid basis which maximizes the product of the weights of the elements. BIT 25, 433–438 (1985). https://doi.org/10.1007/BF01935363

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01935363

Keywords

Search

Navigation