{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:27:59Z","timestamp":1742956079486,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_3","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"29-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Nearly Optimal Randomized Algorithm for\u00a0Explorable Heap Selection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4001-6675","authenticated-orcid":false,"given":"Sander","family":"Borst","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5577-5012","authenticated-orcid":false,"given":"Daniel","family":"Dadush","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2633-014X","authenticated-orcid":false,"given":"Sophie","family":"Huiberts","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7999-4989","authenticated-orcid":false,"given":"Danish","family":"Kashaev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"3_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, TU Berlin (2009)"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005). https:\/\/doi.org\/10.1016\/j.orl.2004.04.002","journal-title":"Oper. Res. Lett."},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Springer, New York (2006). https:\/\/doi.org\/10.1007\/b100809","DOI":"10.1007\/b100809"},{"key":"3_CR4","unstructured":"Balcan, M.F., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: ICML (2018)"},{"key":"3_CR5","unstructured":"Banerjee, S., Cohen-Addad, V., Gupta, A., Li, Z.: Graph searching with predictions, December 2022"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Berman, P.: On-line searching and navigation. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 232\u2013241. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029571","DOI":"10.1007\/BFb0029571"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Borst, S., Dadush, D., Huiberts, S., Kashaev, D.: A nearly optimal randomized algorithm for explorable heap selection, October 2022. https:\/\/doi.org\/10.48550\/arXiv.2210.05982","DOI":"10.48550\/arXiv.2210.05982"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018952429396","volume":"90","author":"J Clausen","year":"1999","unstructured":"Clausen, J., Perregaard, M.: On the best search strategy in parallel branch-and-bound: best-first search versus lazy depth-first search. Ann. Oper. Res. 90, 1\u201317 (1999)","journal-title":"Ann. Oper. Res."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-60692-0_38","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"P Dasgupta","year":"1995","unstructured":"Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.: A near optimal algorithm for the extended cow-path problem in the presence of relative errors. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 22\u201336. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60692-0_38"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. J. Algorithms 51(1), 38\u201363 (2004). https:\/\/doi.org\/10.1016\/j.jalgor.2003.10.002","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/inco.1993.1030","volume":"104","author":"G Frederickson","year":"1993","unstructured":"Frederickson, G.: An optimal algorithm for selection in a min-heap. Inf. Comput. 104(2), 197\u2013214 (1993). https:\/\/doi.org\/10.1006\/inco.1993.1030","journal-title":"Inf. Comput."},{"key":"3_CR12","unstructured":"Gleixner, A.M.: Personal communication, November 2022"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Saks, M.E., Wigderson, A.: On a search problem related to branch-and-bound procedures. In: FOCS, pp. 19\u201328 (1986)","DOI":"10.1109\/SFCS.1986.34"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173\u2013187 (1999). https:\/\/doi.org\/10.1287\/ijoc.11.2.173","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret. Optim. 19, 79\u2013102 (2016). https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret. Optim."},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J Munro","year":"1980","unstructured":"Munro, J., Paterson, M.: Selection and sorting with limited storage. Theoret. Comput. Sci. 12(3), 315\u2013323 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90061-4","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jpdc.2014.09.007","volume":"76","author":"A Pietracaprina","year":"2015","unstructured":"Pietracaprina, A., Pucci, G., Silvestri, F., Vandin, F.: Space-efficient parallel algorithms for combinatorial search problems. J. Parallel Distrib. Comput. 76, 58\u201365 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02025534","volume":"43","author":"LM Suhl","year":"1993","unstructured":"Suhl, L.M., Suhl, U.H.: A fast LU update for linear programming. Ann. Oper. Res. 43(1), 33\u201347 (1993). https:\/\/doi.org\/10.1007\/BF02025534","journal-title":"Ann. Oper. Res."},{"key":"3_CR20","unstructured":"Kamphans, T.: Models and algorithms for online exploration and search. Ph.D. thesis, Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (2006). https:\/\/hdl.handle.net\/20.500.11811\/2622"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:29:09Z","timestamp":1684700949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}