{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:36:53Z","timestamp":1743104213450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_49","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"603-614","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Non-Extendibility Certificate for Submodularity and Applications"],"prefix":"10.1007","author":[{"given":"Umang","family":"Bhaskar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunjan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"3","key":"49_CR1","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Seshadhri, C.: Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In: STOC, pp. 419\u2013428. ACM (2013)","DOI":"10.1145\/2488608.2488661"},{"issue":"3","key":"49_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica 20(3), 301\u2013337 (2000). https:\/\/doi.org\/10.1007\/s004930070011","journal-title":"Combinatorica"},{"issue":"2","key":"49_CR4","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/100789646","volume":"40","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O., Ron, D.: On proximity-oblivious testing. SIAM J. Comput. 40(2), 534\u2013566 (2011)","journal-title":"SIAM J. Comput."},{"key":"49_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"G Gr\u00e4tzer","year":"2011","unstructured":"Gr\u00e4tzer, G.: Lattice Theory: Foundation. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-0348-0018-1"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory of Computing 11, 105\u2013147 (2015)","journal-title":"Theory of Computing"},{"issue":"2","key":"49_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/060669565","volume":"22","author":"A Krokhin","year":"2008","unstructured":"Krokhin, A., Larose, B.: Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction. SIAM J. Discret. Math. 22(1), 312\u2013328 (2008)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"49_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.disopt.2011.04.001","volume":"8","author":"F Kuivinen","year":"2011","unstructured":"Kuivinen, F.: On the complexity of submodular function minimisation on diamonds. Discret. Optim. 8(3), 459\u2013477 (2011)","journal-title":"Discret. Optim."},{"issue":"2","key":"49_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"49_CR11","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM 35(4), 965\u2013984 (1988)","journal-title":"J. ACM"},{"issue":"4","key":"49_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s11083-005-9026-5","volume":"22","author":"SD Promislow","year":"2005","unstructured":"Promislow, S.D., Young, V.R.: Supermodular functions on finite lattices. Order 22(4), 389\u2013413 (2005). https:\/\/doi.org\/10.1007\/s11083-005-9026-5","journal-title":"Order"},{"issue":"1","key":"49_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-012-9719-2","volume":"69","author":"C Seshadhri","year":"2014","unstructured":"Seshadhri, C., Vondr\u00e1k, J.: Is submodularity testable? Algorithmica 69(1), 1\u201325 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9719-2","journal-title":"Algorithmica"},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1287\/opre.26.2.305","volume":"26","author":"DM Topkis","year":"1978","unstructured":"Topkis, D.M.: Minimizing a submodular function on a lattice. Oper. Res. 26(2), 305\u2013321 (1978)","journal-title":"Oper. Res."},{"issue":"6","key":"49_CR15","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/0317054","volume":"17","author":"DM Topkis","year":"1979","unstructured":"Topkis, D.M.: Equilibrium points in nonzero-sum n-person submodular games. SIAM J. Control Optim. 17(6), 773\u2013787 (1979)","journal-title":"SIAM J. Control Optim."},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Varian, H.: Revealed preference. Samuelsonian economics and the twenty-first century, pp. 99\u2013115 (2006)","DOI":"10.1093\/acprof:oso\/9780199298839.003.0007"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:44:57Z","timestamp":1619243097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}