{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T02:36:24Z","timestamp":1778898984632,"version":"3.51.4"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/codit.2019.8820312","type":"proceedings-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:09:32Z","timestamp":1567472972000},"page":"60-66","source":"Crossref","is-referenced-by-count":3,"title":["Submodular Stochastic Probing with Prices"],"prefix":"10.1109","author":[{"given":"Ben","family":"Chugg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takanori","family":"Maehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/s00453-012-9646-2","article-title":"Pass approximation: A framework for analyzing and designing heuristics","volume":"66","author":"uriel","year":"2013","journal-title":"Algorithmica"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1137\/090779346","article-title":"Maximizing non-monotone submodular functions","volume":"40","author":"uriel","year":"2011","journal-title":"SIAM Journal on Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.46"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536459"},{"key":"ref18","author":"singla","year":"2018","journal-title":"Combinatorial Optimization Under Uncertainty Probing and Stopping-Time Algorithms"},{"key":"ref19","first-page":"2523","article-title":"The price of information in combinatorial optimization","author":"singla","year":"2018","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00080"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"ref5","first-page":"182","article-title":"Maximizing a submodular set function subject to a matroid constraint","author":"calinescu","year":"0","journal-title":"Proc Conference on Integer Programming and Combinatorial Optimization"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759948"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0766"},{"key":"ref1","author":"adamczyk","year":"2015","journal-title":"Non-negative submodular stochastic probing via stochastic contention resolution schemes"},{"key":"ref9","first-page":"395","article-title":"Adaptivity vand approximation for stochastic packing problems","author":"dean","year":"0","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0842"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/1910412"}],"event":{"name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","location":"Paris, France","start":{"date-parts":[[2019,4,23]]},"end":{"date-parts":[[2019,4,26]]}},"container-title":["2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8806019\/8820291\/08820312.pdf?arnumber=8820312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:24:27Z","timestamp":1658262267000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8820312\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/codit.2019.8820312","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}