{"id":"https://openalex.org/W4414699918","doi":"https://doi.org/10.4230/lipics.approx/random.2025.25","title":"Covering a Few Submodular Constraints and Applications","display_name":"Covering a Few Submodular Constraints and Applications","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414699918","doi":"https://doi.org/10.4230/lipics.approx/random.2025.25"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.09879","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.09879","pdf_url":"https://arxiv.org/pdf/2507.09879","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.09879","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018354573","display_name":"Tanvi Bajpai","orcid":"https://orcid.org/0000-0003-0585-1966"},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bajpai, Tanvi","raw_affiliation_strings":["Siebel School for Computing and Data Science, University of Illinois, Urbana, IL, USA"],"raw_orcid":"https://orcid.org/0000-0003-0585-1966","affiliations":[{"raw_affiliation_string":"Siebel School for Computing and Data Science, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chekuri, Chandra","raw_affiliation_strings":["Siebel School for Computing and Data Science, University of Illinois, Urbana, IL, USA"],"raw_orcid":"https://orcid.org/0000-0003-3035-1699","affiliations":[{"raw_affiliation_string":"Siebel School for Computing and Data Science, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103247009","display_name":"Pooja Kulkarni","orcid":"https://orcid.org/0000-0003-1983-1317"},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kulkarni, Pooja","raw_affiliation_strings":["Siebel School for Computing and Data Science, University of Illinois, Urbana, IL, USA"],"raw_orcid":"https://orcid.org/0000-0003-1983-1317","affiliations":[{"raw_affiliation_string":"Siebel School for Computing and Data Science, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018354573"],"corresponding_institution_ids":["https://openalex.org/I183874917"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2736775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.6730999946594238,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.6730999946594238,"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/T11567","display_name":"semigroups and automata theory","score":0.6144999861717224,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5636000037193298,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9804999828338623},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.8346999883651733},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6963000297546387},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.692799985408783},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6473000049591064},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.614300012588501},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5878000259399414},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5005999803543091}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9804999828338623},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.8346999883651733},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6963000297546387},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.692799985408783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6539999842643738},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6473000049591064},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.614300012588501},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5878000259399414},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5005999803543091},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4609000086784363},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4496999979019165},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.40130001306533813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3840000033378601},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3334999978542328},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2937999963760376},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.2759999930858612},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2507.09879","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.09879","pdf_url":"https://arxiv.org/pdf/2507.09879","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2507.09879","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.09879","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.approx/random.2025.25","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2025.25","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2507.09879","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.09879","pdf_url":"https://arxiv.org/pdf/2507.09879","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,251],"consider":[1,141],"the":[2,32,59,69,84,130,142,195,215,219,225,266],"problem":[3,116,143],"of":[4,129],"covering":[5,156],"multiple":[6,157],"submodular":[7,24,158],"constraints.":[8],"Given":[9],"a":[10,15,37,92,147,162,175,202,208],"finite":[11],"ground":[12],"set":[13,176,204,221],"$N$,":[14],"cost":[16,39],"function":[17],"$c:":[18],"N":[19],"\\rightarrow":[20],"\\mathbb{R}_+$,":[21],"$r$":[22,72,126,145,243],"monotone":[23],"functions":[25,200],"$f_1,f_2,\\ldots,f_r$":[26],"over":[27],"$N$":[28],"and":[29,75,80,101,105,150,188,262],"requirements":[30],"$b_1,b_2,\\ldots,b_r$":[31],"goal":[33],"is":[34,58,73,91,123,127,146,214],"to":[35],"find":[36],"minimum":[38],"subset":[40],"$S":[41],"\\subseteq":[42],"N$":[43],"such":[44,178],"that":[45,167,179,231,255],"$f_i(S)":[46,180],"\\ge":[47],"b_i$":[48],"for":[49,83,114,168,183,218,240,249],"$1":[50],"\\le":[51,53,190],"i":[52],"r$.":[54],"When":[55],"$r=1$":[56],"this":[57,133],"well-known":[60],"Submodular":[61],"Set":[62],"Cover":[63],"problem.":[64],"Previous":[65],"work":[66],"\\cite{chekuri2022covering}":[67],"considered":[68],"setting":[70],"when":[71,88,125,144,194],"large":[74],"developed":[76],"bi-criteria":[77,164],"approximation":[78,81,112,165,216,239],"algorithms,":[79],"algorithms":[82],"important":[85],"special":[86,109],"case":[87],"each":[89,184],"$f_i$":[90,196],"weighted":[93,198],"coverage":[94,199],"function.":[95],"These":[96,228],"are":[97,117,197],"fairly":[98],"general":[99,260],"models":[100],"capture":[102],"several":[103],"concrete":[104],"interesting":[106],"problems":[107],"as":[108,236,244],"cases.":[110],"The":[111],"ratios":[113],"these":[115,259],"at":[118],"least":[119],"$\u03a9(\\log":[120],"r)$":[121],"which":[122],"unavoidable":[124],"part":[128],"input.":[131],"In":[132],"paper,":[134],"motivated":[135],"by":[136],"some":[137,253],"recent":[138],"applications,":[139],"we":[140,160,206],"\\emph{fixed":[148],"constant}":[149],"obtain":[151,161,207,234],"two":[152],"main":[153],"results.":[154],"For":[155],"constraints":[159],"randomized":[163],"algorithm":[166],"any":[169,241],"given":[170],"integer":[171],"$\u03b1\\ge":[172],"1$":[173],"outputs":[174],"$S$":[177],"\\ge$":[181],"$(1-1/e^\u03b1-\u03b5)b_i$":[182],"$i":[185],"\\in":[186],"[r]$":[187],"$\\mathbb{E}[c(S)]":[189],"(1+\u03b5)\u03b1\\cdot":[191],"\\sf{OPT}$.":[192],"Second,":[193],"from":[201,258],"deletion-closed":[203],"system":[205],"$(1+\u03b5)$":[209],"$(\\frac{e}{e-1})$":[210],"$(1+\u03b2)$-approximation":[211],"where":[212],"$\u03b2$":[213],"ratio":[217],"underlying":[220],"cover":[222],"instances":[223],"via":[224],"natural":[226],"LP.":[227],"results":[229,261],"show":[230],"one":[232,246],"can":[233],"nearly":[235],"good":[237],"an":[238],"fixed":[242],"what":[245],"would":[247],"achieve":[248],"$r=1$.":[250],"mention":[252],"applications":[254],"follow":[256],"easily":[257],"anticipate":[263],"more":[264],"in":[265],"future.":[267]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-01T00:00:00"}