{"id":"https://openalex.org/W2342745562","doi":"https://doi.org/10.1145/2876506","title":"Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack","display_name":"Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack","publication_year":2016,"publication_date":"2016-04-25","ids":{"openalex":"https://openalex.org/W2342745562","doi":"https://doi.org/10.1145/2876506","mag":"2342745562"},"language":"en","primary_location":{"id":"doi:10.1145/2876506","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2876506","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113637223","display_name":"Amol Deshpande","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amol Deshpande","raw_affiliation_strings":["University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039703362","display_name":"Lisa Hellerstein","orcid":"https://orcid.org/0000-0002-3743-7965"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lisa Hellerstein","raw_affiliation_strings":["NYU School of Engineering, Brooklyn, NY"],"affiliations":[{"raw_affiliation_string":"NYU School of Engineering, Brooklyn, NY","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088605172","display_name":"Devorah Kletenik","orcid":"https://orcid.org/0000-0003-4362-3884"},"institutions":[{"id":"https://openalex.org/I174216632","display_name":"City University of New York","ror":"https://ror.org/00453a208","country_code":"US","type":"education","lineage":["https://openalex.org/I174216632"]},{"id":"https://openalex.org/I83041322","display_name":"Brooklyn College","ror":"https://ror.org/019k4jq75","country_code":"US","type":"education","lineage":["https://openalex.org/I83041322"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Devorah Kletenik","raw_affiliation_strings":["Brooklyn College, City University of New York, Brooklyn, NY"],"affiliations":[{"raw_affiliation_string":"Brooklyn College, City University of New York, Brooklyn, NY","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I174216632"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113637223"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.4393,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.8959963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"3","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8260290622711182},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8225152492523193},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6966971755027771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6178326606750488},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5710414052009583},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5555324554443359},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5050747990608215},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4936724603176117},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4704042077064514},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4676945209503174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44474586844444275},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.44369223713874817},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.432736337184906},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4312349259853363},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3914949893951416},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3030646741390228},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.291821151971817},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2707475423812866}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8260290622711182},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8225152492523193},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6966971755027771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6178326606750488},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5710414052009583},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5555324554443359},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5050747990608215},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4936724603176117},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4704042077064514},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4676945209503174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44474586844444275},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.44369223713874817},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.432736337184906},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4312349259853363},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3914949893951416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3030646741390228},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.291821151971817},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2707475423812866},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2876506","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2876506","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1591858565","display_name":null,"funder_award_id":"1217968, 0917153, 0916736, 1218367","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4570966928","display_name":null,"funder_award_id":"P200A090157","funder_id":"https://openalex.org/F4320306106","funder_display_name":"U.S. Department of Education"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306106","display_name":"U.S. Department of Education","ror":"https://ror.org/021adze67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W166430344","https://openalex.org/W1480030792","https://openalex.org/W1497312391","https://openalex.org/W1527303878","https://openalex.org/W1527986773","https://openalex.org/W1531390321","https://openalex.org/W1533065391","https://openalex.org/W1554813885","https://openalex.org/W1572332593","https://openalex.org/W1583926746","https://openalex.org/W1600627413","https://openalex.org/W1605455774","https://openalex.org/W1753077474","https://openalex.org/W1784783114","https://openalex.org/W1848188550","https://openalex.org/W1968413363","https://openalex.org/W1973935176","https://openalex.org/W1978007997","https://openalex.org/W1984628625","https://openalex.org/W1988868340","https://openalex.org/W1996837595","https://openalex.org/W2000081322","https://openalex.org/W2025624833","https://openalex.org/W2026501144","https://openalex.org/W2029828838","https://openalex.org/W2031264603","https://openalex.org/W2034424699","https://openalex.org/W2040973615","https://openalex.org/W2054699205","https://openalex.org/W2057557663","https://openalex.org/W2058792175","https://openalex.org/W2066623874","https://openalex.org/W2072001382","https://openalex.org/W2092795460","https://openalex.org/W2098730982","https://openalex.org/W2130519052","https://openalex.org/W2131552728","https://openalex.org/W2150597708","https://openalex.org/W2156206831","https://openalex.org/W2168009816","https://openalex.org/W2171764109","https://openalex.org/W2175796269","https://openalex.org/W2200983898","https://openalex.org/W2238389504","https://openalex.org/W2331966877","https://openalex.org/W2476126503","https://openalex.org/W2560674852","https://openalex.org/W2561675875","https://openalex.org/W2568156492","https://openalex.org/W2590610501","https://openalex.org/W2607666848","https://openalex.org/W2951249809","https://openalex.org/W2962795549","https://openalex.org/W4240196045"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3047700137","https://openalex.org/W2962866360","https://openalex.org/W3166857172","https://openalex.org/W1497312391","https://openalex.org/W1701984136","https://openalex.org/W3169691842","https://openalex.org/W1621774961","https://openalex.org/W2060645964"],"abstract_inverted_index":{"We":[0,19,41,63,85],"present":[1],"a":[2,25,44,55,58,65,70,110,134,151],"new":[3,66,111],"approximation":[4,67,153],"algorithm":[5,22,27,46,72,80],"for":[6,36,47,57,69,73,113,155,159],"the":[7,29,48,74,77,95,102,141,156],"stochastic":[8,30,51],"submodular":[9],"set":[10],"cover":[11],"(SSSC)":[12],"problem":[13,35,53,158],"called":[14],"adaptive":[15,78,96],"dual":[16],"greedy":[17,79,97],".":[18],"use":[20],"this":[21],"to":[23,90,129,149],"obtain":[24,43,150],"3-approximation":[26,45],"solving":[28],"Boolean":[31],"function":[32],"evaluation":[33,114,131],"(SBFE)":[34],"linear":[37],"threshold":[38],"formulas":[39],"(LTFs).":[40],"also":[42,86],"closely":[49],"related":[50],"min-knapsack":[52],"and":[54,83,123,133],"2-approximation":[56],"variant":[59],"of":[60,81,115,127],"that":[61,140],"problem.":[62,136],"prove":[64],"bound":[68],"previous":[71],"SSSC":[75],"problem,":[76],"Golovin":[82],"Krause.":[84],"consider":[87],"an":[88],"approach":[89,107,144],"approximating":[91],"SBFE":[92,157],"problems":[93,132],"using":[94],"algorithm,":[98],"which":[99],"we":[100,124,138],"call":[101],"Q":[103,142],"-value":[104,143],"approach.":[105],"This":[106],"easily":[108],"yields":[109],"result":[112],"CDNF":[116],"(conjunctive":[117],"/":[118],"disjunctive":[119,163],"normal":[120,164],"form)":[121],"formulas,":[122],"apply":[125],"variants":[126],"it":[128],"simultaneous":[130],"ranking":[135],"However,":[137],"show":[139],"provably":[145],"cannot":[146],"be":[147],"used":[148],"sublinear":[152],"factor":[154],"LTFs":[160],"or":[161],"read-once":[162],"form":[165],"formulas.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-19T23:35:23.961156","created_date":"2025-10-10T00:00:00"}