{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:36:33Z","timestamp":1742992593570,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031183669"},{"type":"electronic","value":"9783031183676"}],"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-18367-6_10","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:05:36Z","timestamp":1666281936000},"page":"190-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptivity Gaps for\u00a0the\u00a0Stochastic Boolean Function Evaluation Problem"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Hellerstein","sequence":"first","affiliation":[]},{"given":"Devorah","family":"Kletenik","sequence":"additional","affiliation":[]},{"given":"Naifeng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"R. Teal","family":"Witter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Assadi, S., Khanna, S.: Stochastic submodular cover with limited adaptivity. In: Chan, T.M. (ed.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 323\u2013342. SIAM (2019)","DOI":"10.1137\/1.9781611975482.21"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-92185-1_53","volume-title":"Internet and Network Economics","author":"A Asadpour","year":"2008","unstructured":"Asadpour, A., Nazerzadeh, H., Saberi, A.: Stochastic submodular maximization. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 477\u2013489. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_53"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-1-4615-4567-5_3","volume-title":"Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research","author":"E Boros","year":"2000","unstructured":"Boros, E., Unyulurt, T.: Sequential testing of series-parallel systems of small depth. In: Laguna, M., Velarde, J.L.G. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 39\u201373. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4615-4567-5_3"},{"key":"10_CR4","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, Oxford (2013)"},{"key":"10_CR5","unstructured":"Bradac, D., Singla, S., Zuzic, G.: (Near) optimal adaptivity gaps for stochastic multi-value probing. In: Achlioptas, D., V\u00e9gh, L.A. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2019, 20\u201322 September 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. LIPIcs, vol. 145, pp. 49:1\u201349:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"10","key":"10_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/10652460802332342","volume":"19","author":"M Bronstein","year":"2008","unstructured":"Bronstein, M., Corless, R.M., Davenport, J.H., Jeffrey, D.J.: Algebraic properties of the Lambert W function from a result of Rosenlicht and of Liouville. Integral Transform. Spec. Funct. 19(10), 709\u2013712 (2008)","journal-title":"Integral Transform. Spec. Funct."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. In: Proceedings of 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, pp. 208\u2013217. IEEE Computer Society (2004)","DOI":"10.1109\/FOCS.2004.15"},{"key":"10_CR8","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, 23\u201325 January 2005, pp. 395\u2013404. SIAM (2005)"},{"issue":"4","key":"10_CR9","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."},{"key":"10_CR10","doi-asserted-by":"crossref","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), 42:1\u201342:28 (2016)","DOI":"10.1145\/2876506"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"770","DOI":"10.2307\/3214014","volume":"23","author":"E El-Neweihi","year":"1986","unstructured":"El-Neweihi, E., Proschan, F., Sethuraman, J.: Optimal allocation of components in parallel-series and series-parallel systems. J. Appl. Probab. 23(3), 770\u2013777 (1986)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D.: Parallel recognition of series-parallel graphs. Inf. Comput. 98(1), 41\u201355 (1992)","journal-title":"Inf. Comput."},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"3237","DOI":"10.1109\/TNET.2017.2725905","volume":"25","author":"L Fu","year":"2017","unstructured":"Fu, L., Fu, X., Xu, Z., Peng, Q., Wang, X., Lu, S.: Determining source-destination connectivity in uncertain networks: modeling and solutions. IEEE\/ACM Trans. Netw. 25(6), 3237\u20133252 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10_CR14","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":"10_CR15","doi-asserted-by":"crossref","unstructured":"Ghuge, R., Gupta, A., Nagarajan, V.: The power of adaptivity for stochastic submodular cover. In: Proceedings of the 38th International Conference on Machine Learning, ICML (2021)","DOI":"10.1287\/opre.2022.2388"},{"key":"10_CR16","unstructured":"Gkenosis, D., Grammel, N., Hellerstein, L., Kletenik, D.: The stochastic score classification problem. In: 26th Annual European Symposium on Algorithms, ESA 2018, 20\u201322 August 2018, Helsinki, Finland, pp. 36:1\u201336:14 (2018)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11682462_50","volume-title":"LATIN 2006: Theoretical Informatics","author":"M Goemans","year":"2006","unstructured":"Goemans, M., Vondr\u00e1k, J.: Stochastic covering and adaptivity. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 532\u2013543. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_50"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.artint.2005.09.002","volume":"170","author":"R Greiner","year":"2006","unstructured":"Greiner, R., Hayward, R., Jankowska, M., Molloy, M.: Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170(1), 19\u201358 (2006)","journal-title":"Artif. Intell."},{"key":"10_CR19","unstructured":"Gupta, A., Nagarajan, V., Singla, S.: Algorithms and adaptivity gaps for stochastic probing. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 1731\u20131747. SIAM (2016)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V., Singla, S.: Adaptivity gaps for stochastic probing: submodular and XOS functions. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January 2017, pp. 1688\u20131702. SIAM (2017)","DOI":"10.1137\/1.9781611974782.111"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Happach, F., Hellerstein, L., Lidbetter, T.: A general framework for approximating min sum ordering problems. INFORMS J. Comput. 34(3), 1437\u20131452. https:\/\/doi.org\/10.1287\/ijoc.2021.1124","DOI":"10.1287\/ijoc.2021.1124"},{"key":"10_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"TE Harris","year":"1963","unstructured":"Harris, T.E., et al.: The Theory of Branching Processes, vol. 6. Springer, Berlin (1963)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Harvey, N.J., Patrascu, M., Wen, Y., Yekhanin, S., Chan, V.W.: Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs. In: IEEE INFOCOM 2007\u201326th IEEE International Conference on Computer Communications, pp. 697\u2013705. IEEE (2007)","DOI":"10.1109\/INFCOM.2007.87"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Hellerstein, L., Kletenik, D., Lin, P.: Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline. In: Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC) (2015)","DOI":"10.1007\/978-3-319-18173-8_17"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with attribute costs. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 356\u2013365. ACM (2005)","DOI":"10.1145\/1060590.1060644"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with attribute costs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, (STOC), pp. 356\u2013365 (2005)","DOI":"10.1145\/1060590.1060644"},{"key":"10_CR27","unstructured":"Kowshik, H.J.: Information aggregation in sensor networks. University of Illinois at Urbana-Champaign (2011)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Liva, G., Paolini, E., Chiani, M.: Optimum detection of defective elements in non-adaptive group testing. In: 2021 55th Annual Conference on Information Sciences and Systems (CISS), pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/CISS50987.2021.9400279"},{"key":"10_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014)"},{"issue":"1\u20133","key":"10_CR30","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. Discret. Appl. Math. 142(1\u20133), 189\u2013205 (2004)","journal-title":"Discret. Appl. Math."},{"key":"10_CR31","unstructured":"Wikipedia: Series and parallel circuits \u2013 Wikipedia, the free encyclopedia (2022). Accessed 8 Feb 2022"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18367-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T07:29:30Z","timestamp":1728199770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18367-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031183669","9783031183676"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18367-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"21","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":"12","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":"57% - 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":"3","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)"}}]}}