{"id":"https://openalex.org/W7136176475","doi":"https://doi.org/10.48550/arxiv.2603.12528","title":"Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation","display_name":"Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7136176475","doi":"https://doi.org/10.48550/arxiv.2603.12528"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.12528","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12528","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.12528","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129520302","display_name":"Nima Shahbazi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shahbazi, Nima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114419945","display_name":"Aryan Esmailpour","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Esmailpour, Aryan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015883931","display_name":"Stavros Sintos","orcid":"https://orcid.org/0000-0002-2114-8886"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sintos, Stavros","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.36090001463890076,"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.36090001463890076,"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/T12176","display_name":"Optimization and Packing Problems","score":0.12549999356269836,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.10260000079870224,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6676999926567078},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.625},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6075000166893005},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5946999788284302},{"id":"https://openalex.org/keywords/universe","display_name":"Universe","score":0.5748000144958496},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47119998931884766},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4586000144481659},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4320000112056732}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6676999926567078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.633400022983551},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.625},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6075000166893005},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5946999788284302},{"id":"https://openalex.org/C84999194","wikidata":"https://www.wikidata.org/wiki/Q1","display_name":"Universe","level":2,"score":0.5748000144958496},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47119998931884766},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4320000112056732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42669999599456787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4124999940395355},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36010000109672546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3125},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.2906999886035919},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.28380000591278076},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2676999866962433},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.12528","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12528","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.12528","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12528","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6742627620697021,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"weighted":[1,81],"set":[2,10,82],"multi-cover":[3,83],"problem":[4,84],"is":[5,85,115,144,152,209,222],"a":[6,21,26,91,131,159,179,194],"fundamental":[7],"generalization":[8],"of":[9,29,94,147,177,212],"cover":[11],"that":[12,96,135,238],"arises":[13],"in":[14,139,169,248],"data-driven":[15],"applications":[16],"where":[17,111,142,172,207],"one":[18],"must":[19,97],"select":[20],"small,":[22],"low-cost":[23],"subset":[24],"from":[25,62],"large":[27,63,190,262],"collection":[28],"candidates":[30],"under":[31],"coverage":[32],"constraints.":[33],"In":[34,117],"data":[35,74],"management":[36],"settings,":[37],"such":[38],"problems":[39],"arise":[40],"naturally":[41],"either":[42],"as":[43,48],"expressive":[44],"database":[45,67],"queries":[46,68],"or":[47,59,76],"post-processing":[49],"steps":[50],"over":[51,261],"query":[52,263],"results,":[53],"for":[54,69,126,189,257],"example,":[55],"when":[56],"selecting":[57],"representative":[58],"diverse":[60],"subsets":[61],"relations":[64],"returned":[65],"by":[66,227],"decision":[70],"support,":[71],"recommendation,":[72],"fairness-aware":[73],"selection,":[75],"crowd-sourcing.":[77],"While":[78],"the":[79,102,112,145,153,175,210,213,217,228],"general":[80],"NP-complete,":[86],"many":[87],"practical":[88],"workloads":[89],"involve":[90],"\\emph{bounded":[92],"universe}":[93],"items":[95],"be":[98],"covered,":[99],"leading":[100],"to":[101,216],"Weighted":[103],"Set":[104],"Multi-Cover":[105],"with":[106,182,198],"Bounded":[107],"Universe":[108],"(WSMC-BU)":[109],"problem,":[110],"universe":[113,154],"size":[114],"constant.":[116],"this":[118],"paper,":[119],"we":[120,192],"develop":[121],"exact":[122],"and":[123,150,166,220,234,244,252],"approximation":[124],"algorithms":[125],"WSMC-BU.":[127],"We":[128,156],"first":[129],"discuss":[130],"dynamic":[132],"programming":[133,165],"algorithm":[134,161,197],"solves":[136],"WSMC-BU":[137],"exactly":[138],"$O(n^{\\ell+1})$":[140],"time,":[141,171],"$n$":[143],"number":[146],"input":[148],"sets":[149],"$\\ell=O(1)$":[151],"size.":[155],"then":[157],"present":[158],"$2$-approximation":[160],"based":[162],"on":[163,232],"linear":[164,180],"rounding,":[167],"running":[168,199],"$O(\\mathcal{L}(n))$":[170],"$\\mathcal{L}(n)$":[173],"denotes":[174],"complexity":[176],"solving":[178],"program":[181],"$O(n)$":[183],"variables.":[184],"To":[185],"further":[186],"improve":[187],"efficiency":[188],"datasets,":[191],"propose":[193],"faster":[195],"$(2+\\varepsilon)$-approximation":[196],"time":[200],"$O(n":[201],"\\log":[202],"n":[203],"+":[204],"\\mathcal{L}(\\log":[205],"W))$,":[206],"$W$":[208],"ratio":[211],"total":[214],"weight":[215],"minimum":[218],"weight,":[219],"$\\varepsilon$":[221],"an":[223],"arbitrary":[224],"constant":[225],"specified":[226],"user.":[229],"Extensive":[230],"experiments":[231],"real":[233],"synthetic":[235],"datasets":[236],"demonstrate":[237],"our":[239],"methods":[240],"consistently":[241],"outperform":[242],"greedy":[243],"standard":[245],"LP-rounding":[246],"baselines":[247],"both":[249],"solution":[250],"quality":[251],"runtime,":[253],"making":[254],"them":[255],"suitable":[256],"data-intensive":[258],"selection":[259],"tasks":[260],"outputs.":[264]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-17T00:00:00"}