{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:17:12Z","timestamp":1649114232863},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1007\/bf01935363","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T12:48:33Z","timestamp":1122295713000},"page":"433-438","source":"Crossref","is-referenced-by-count":2,"title":["An algorithm for finding a matroid basis which maximizes the product of the weights of the elements"],"prefix":"10.1007","volume":"25","author":[{"given":"T. I.","family":"Fenner","sequence":"first","affiliation":[]},{"given":"A. M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01935363_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230070405","volume":"7","author":"R. Chandrasekaran","year":"1977","unstructured":"R. Chandrasekaran,Minimum ratio spanning trees, Networks 7 (1977) 335\u2013342.","journal-title":"Networks"},{"key":"BF01935363_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds,Matroids and the greedy algorithm, Mathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"BF01935363_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013346.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"BF01935363_CR4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","volume":"5","author":"H. N. Gabow","year":"1984","unstructured":"H. N. Gabow and R. E. Tarjan,Efficient algorithms for a family of matroid intersection problems, Journal of Algorithms 5 (1984) 80\u2013131.","journal-title":"Journal of Algorithms"},{"key":"BF01935363_CR5","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"D. Gale,Optimal assignments in an ordered set: an application of matroid theory, Journal of Combinatorial Theory 4 (1968) 176\u2013180.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF01935363_CR6","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York (1976)."},{"key":"BF01935363_CR7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"N. Megiddo,Combinatorial optimization with rational objective functions, Mathematics of Operations Research 4 (1979) 414\u2013424.","journal-title":"Mathematics of Operations Research"},{"key":"BF01935363_CR8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"7","author":"R. Rado","year":"1957","unstructured":"R. Rado,Note on independence functions, Proceedings of the London Mathematical Society 7 (1957) 300\u2013320.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"BF01935363_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R. E. Tarjan","year":"1982","unstructured":"R. E. Tarjan,Sensitivity analysis of minimum spanning trees and shortest path trees, Information Processing Letters 14 (1982) 30\u201333.","journal-title":"Information Processing Letters"},{"key":"BF01935363_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S030500410004247X","volume":"64","author":"D. J. A. Welsh","year":"1968","unstructured":"D. J. A. Welsh,Kruskal's algorithm for matroids, Proceedings of the Cambridge Philosophical Society 64 (1968) 3\u20134.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"BF01935363_CR11","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh,Matroid Theory, Academic Press, London (1976)."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01935363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01935363\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01935363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:03:23Z","timestamp":1557749003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01935363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["BF01935363"],"URL":"https:\/\/doi.org\/10.1007\/bf01935363","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}