{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:36:27Z","timestamp":1742924187887,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_33","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"397-408","source":"Crossref","is-referenced-by-count":15,"title":["Competitive Weighted Matching in Transversal Matroids"],"prefix":"10.1007","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","reference":[{"key":"33_CR1","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, pp. 434\u2013443 (January 2007)"},{"key":"33_CR2","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":"33_CR3","doi-asserted-by":"crossref","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Competitive weighted matching in transversal matroids. Technical Report TR\u201308\u201304, Department of Computer Science, University of Texas at Austin (January 2008)","DOI":"10.1007\/978-3-540-70575-8_33"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T. Ferguson","year":"1989","unstructured":"Ferguson, T.: Who solved the secretary problem? Statistical Science\u00a04, 282\u2013289 (1989)","journal-title":"Statistical Science"},{"key":"33_CR5","doi-asserted-by":"publisher","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 review. International Statistical Review\u00a051, 189\u2013206 (1983)","journal-title":"International Statistical Review"},{"key":"33_CR6","first-page":"41","volume":"82","author":"D. Karger","year":"1998","unstructured":"Karger, D.: Random sampling and greedy sparsification for matroid optimizaiton problems. Mathematical Programming\u00a082, 41\u201381 (1998)","journal-title":"Mathematical Programming"},{"key":"33_CR7","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, pp. 630\u2013631 (January 2005)"},{"key":"33_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"2001","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Dover Publications, Mineola (2001)"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"D.V. Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Applied Statistics\u00a010, 39\u201351 (1961)","journal-title":"Applied Statistics"},{"key":"33_CR10","first-page":"179","volume":"5","author":"J. Oxley","year":"2003","unstructured":"Oxley, J.: What is a matroid? Cubo.\u00a05, 179\u2013218 (2003)","journal-title":"Cubo."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:27:55Z","timestamp":1714620475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}