{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:14:57Z","timestamp":1767676497918,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_42","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:05:04Z","timestamp":1246547104000},"page":"508-520","source":"Crossref","is-referenced-by-count":71,"title":["Algorithms for Secretary Problems on Graphs and Hypergraphs"],"prefix":"10.1007","author":[{"given":"Nitish","family":"Korula","sequence":"first","affiliation":[]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary Problems: Weights and Discounts. In: Proc. of ACM-SIAM SODA, pp. 1245\u20131254 (2009)","DOI":"10.1137\/1.9781611973068.135"},{"key":"42_CR2","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, Secretary Problems, and Online Mechanisms. In: Proc. of ACM-SIAM SODA, pp. 434\u2013443 (2007)"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A Knapsack Secretary Problem with Applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX 2007. LNCS, vol.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Constantin, F., Feldman, J., Muthukrishnan, S., P\u00e1l, M.: Online Ad Slotting with Cancellations. In: Proc. of ACM-SIAM SODA, pp. 1265\u20131274 (2009)","DOI":"10.1137\/1.9781611973068.137"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-70575-8_33","volume-title":"Automata, Languages and Programming","author":"N.B. Dimitrov","year":"2008","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Competitive Weighted Matching in Transversal Matroids. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 397\u2013408. Springer, Heidelberg (2008)"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T.S. Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who Solved the Secretary Problem? J. Stat. Sci.\u00a04, 282\u2013289 (1989)","journal-title":"J. Stat. Sci."},{"key":"42_CR7","unstructured":"Gardner, M.: Mathematical Games column. Scientific Amer.\u00a035 (February\/March 1960)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: Proc. 5th ACM Conf. on Electronic commerce, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"key":"42_CR9","unstructured":"Jenkyns, T.A.: The efficiency of the \u201cgreedy\u201d algorithm. In: Proc. of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing, pp. 341\u2013350 (1976)"},{"key":"42_CR10","unstructured":"Kleinberg, R.: A multiple-choice secretary problem with applications to online auctions. In: Proc. of ACM-SIAM SODA, pp. 630\u2013631 (2005)"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/11841036_48","volume-title":"Algorithms \u2013 ESA 2006","author":"J. Mestre","year":"2006","unstructured":"Mestre, J.: Greedy in Approximation Algorithms. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 528\u2013539. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T16:44:14Z","timestamp":1739205854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}