{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:39:02Z","timestamp":1787510342747,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069000","type":"print"},{"value":"9783031069017","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_21","type":"book-chapter","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T20:22:30Z","timestamp":1653596550000},"page":"277-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Non-adaptive Stochastic Score Classification and\u00a0Explainable Halfspace Evaluation"],"prefix":"10.1007","author":[{"given":"Rohan","family":"Ghuge","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Allen, S., Hellerstein, L., Kletenik, D., \u00dcnl\u00fcyurt, T.: Evaluation of monotone DNF formulas. Algorithmica 77 (2015)","DOI":"10.1007\/s00453-015-0092-9"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s00453-011-9511-8","volume":"63","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., Rudra, A.: When LP is the cure for your matching woes: improved bounds for stochastic matchings. Algorithmica 63(4), 733\u2013762 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9511-8","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"21_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-015-0927-9","volume":"154","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Nagarajan, V.: On the adaptivity gap of stochastic orienteering. Math. Program. 154(1\u20132), 145\u2013172 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0927-9","journal-title":"Math. Program."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Derakhshan, M., Hajiaghayi, M.: Stochastic matching with few queries: (1-$$\\epsilon $$) approximation. In: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1111\u20131124 (2020)","DOI":"10.1145\/3357713.3384340"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: SODA, pp. 1647\u20131665 (2011)","DOI":"10.1137\/1.9781611973082.127"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Blanc, G., Lange, J., Tan, L.Y.: Query strategies for priced information, revisited. In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), pp. 1638\u20131650 (2021)","DOI":"10.1137\/1.9781611976465.99"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J., Raghavan, P., Sahai, A.: Query strategies for priced information (extended abstract), pp. 582\u2013591 (2000)","DOI":"10.1145\/335305.335382"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Laber, E.S.: A new strategy for querying priced information. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 674\u2013683 (2005)","DOI":"10.1145\/1060590.1060691"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Laber, E.S.: On the competitive ratio of evaluating priced functions. J. ACM, 58(3) (2011)","DOI":"10.1145\/1970392.1970393"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2876506","volume":"12","author":"A Deshpande","year":"2016","unstructured":"Deshpande, A., Hellerstein, L., Kletenik, D.: Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack. ACM Trans. Algorithms 12(3), 1\u201328 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR12","unstructured":"Ene, A., Nagarajan, V., Saket, R.: Approximation algorithms for stochastic k-TSP. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 27:14\u201327:27 (2017)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Ghuge, R., Gupta, A., Nagarajan, V.: Non-adaptive stochastic score classification and explainable halfspace evaluation. CoRR abs\/2111.05687 (2021)","DOI":"10.1007\/978-3-031-06901-7_21"},{"key":"21_CR14","unstructured":"Gkenosis, D., Grammel, N., Hellerstein, L., Kletenik, D.: The stochastic score classification problem. In: 26th Annual European Symposium on Algorithms (ESA), vol. 112, pp. 36:1\u201336:14 (2018)"},{"key":"21_CR15","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: a new approach to active learning and stochastic optimization. CoRR abs\/1003.3967 (2017)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-02930-1_41","volume-title":"Automata, Languages and Programming","author":"S Guha","year":"2009","unstructured":"Guha, S., Munagala, K.: Multi-armed bandits with metric switching costs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 496\u2013507. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_41"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/moor.2014.0656","volume":"40","author":"A Gupta","year":"2015","unstructured":"Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Running errands in time: approximation algorithms for stochastic orienteering. Math. Oper. Res. 40(1), 56\u201379 (2015)","journal-title":"Math. Oper. Res."},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-36694-9_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Gupta","year":"2013","unstructured":"Gupta, A., Nagarajan, V.: A stochastic probing problem with applications. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 205\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_18"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V., Singla, S.: Adaptivity gaps for stochastic probing: submodular and XOS functions. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1688\u20131702 (2017)","DOI":"10.1137\/1.9781611974782.111"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Im, S., Nagarajan, V., van der Zwaan, R.: Minimum latency submodular cover. ACM Trans. Algorithms 13(1), 13:1\u201313:28 (2016)","DOI":"10.1145\/2987751"},{"key":"21_CR21","unstructured":"Jiang, H., Li, J., Liu, D., Singla, S.: Algorithms and adaptivity gaps for stochastic k-TSP. In: 11th Innovations in Theoretical Computer Science Conference (ITCS), vol. 151, pp. 45:1\u201345:25 (2020)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with attribute costs. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 356\u2013365 (2005)","DOI":"10.1145\/1060590.1060644"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.dam.2002.08.001","volume":"142","author":"T \u00dcnl\u00fcyurt","year":"2004","unstructured":"\u00dcnl\u00fcyurt, T.: Sequential testing of complex systems: a review. Discrete Appl. Math. 142(1), 189\u2013205 (2004)","journal-title":"Discrete Appl. Math."}],"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-06901-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T19:04:05Z","timestamp":1653937445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","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":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","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":"93","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":"35% - 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":"33","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)"}}]}}