{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:23:29Z","timestamp":1777339409532,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,10,21]],"date-time":"2010-10-21T00:00:00Z","timestamp":1287619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00453-010-9457-2","type":"journal-article","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T17:01:22Z","timestamp":1287594082000},"page":"333-348","source":"Crossref","is-referenced-by-count":24,"title":["Competitive Weighted Matching in Transversal Matroids"],"prefix":"10.1007","volume":"62","author":[{"given":"Nedialko B.","family":"Dimitrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Greg","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,21]]},"reference":[{"key":"9457_CR1","first-page":"434","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2007, pp.\u00a0434\u2013443 (2008)"},{"key":"9457_CR2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"B. Birnbaum","year":"2008","unstructured":"Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39, 80\u201387 (2008)","journal-title":"SIGACT News"},{"key":"9457_CR3","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"9457_CR4","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T. Ferguson","year":"1989","unstructured":"Ferguson, T.: Who solved the secretary problem? Stat. Sci. 4, 282\u2013289 (1989)","journal-title":"Stat. Sci."},{"key":"9457_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.2307\/1402748","volume":"51","author":"P.R. Freeman","year":"1983","unstructured":"Freeman, P.R.: The secretary problem and its extensions: a\u00a0review. Int. Stat. Rev. 51, 189\u2013206 (1983)","journal-title":"Int. Stat. Rev."},{"key":"9457_CR6","first-page":"41","volume":"82","author":"D. Karger","year":"1998","unstructured":"Karger, D.: Random sampling and greedy sparsification for matroid optimization problems. Math. Program. 82, 41\u201381 (1998)","journal-title":"Math. Program."},{"key":"9457_CR7","first-page":"352","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing","author":"R.M. Karp","year":"1990","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, New York, NY, USA, May 1990, pp.\u00a0352\u2013358 (1990)"},{"key":"9457_CR8","first-page":"630","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"R. Kleinberg","year":"2005","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2005, pp.\u00a0630\u2013631 (2005)"},{"key":"9457_CR9","doi-asserted-by":"crossref","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. arXiv:0807.1139v1 . July 2008","DOI":"10.1007\/978-3-642-02930-1_42"},{"key":"9457_CR10","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"2001","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Dover, Mineola (2001)"},{"key":"9457_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"D.V. Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Appl. Stat. 10, 39\u201351 (1961)","journal-title":"Appl. Stat."},{"key":"9457_CR12","first-page":"179","volume":"5","author":"J. Oxley","year":"2003","unstructured":"Oxley, J.: What is a matroid? Cubo 5, 179\u2013218 (2003)","journal-title":"Cubo"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9457-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9457-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9457-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T14:09:19Z","timestamp":1559743759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9457-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,21]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9457"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9457-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,21]]}}}