{"id":"https://openalex.org/W2343846702","doi":"https://doi.org/10.1145/2843944","title":"All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns","display_name":"All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns","publication_year":2016,"publication_date":"2016-04-25","ids":{"openalex":"https://openalex.org/W2343846702","doi":"https://doi.org/10.1145/2843944","mag":"2343846702"},"language":"en","primary_location":{"id":"doi:10.1145/2843944","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2843944","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/A5021589351","display_name":"Ron Adany","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ron Adany","raw_affiliation_strings":["Bar-Ilan University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moran Feldman","raw_affiliation_strings":["Technion"],"raw_orcid":"https://orcid.org/0000-0002-1535-2979","affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083880608","display_name":"Elad Haramaty","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Elad Haramaty","raw_affiliation_strings":["Technion"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074837451","display_name":"Rohit Khandekar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rohit Khandekar","raw_affiliation_strings":["Knight Capital Group"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Knight Capital Group","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["IBM Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":["Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061815610","display_name":"Hadas Shachnai","orcid":"https://orcid.org/0000-0002-6645-4350"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Hadas Shachnai","raw_affiliation_strings":["Technion"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084411441","display_name":"Tami Tamir","orcid":"https://orcid.org/0000-0002-8409-562X"},"institutions":[{"id":"https://openalex.org/I138898306","display_name":"Reichman University","ror":"https://ror.org/01px5cv07","country_code":"IL","type":"education","lineage":["https://openalex.org/I138898306"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tami Tamir","raw_affiliation_strings":["The Interdisciplinary Center, Herzliya, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Interdisciplinary Center, Herzliya, Israel","institution_ids":["https://openalex.org/I138898306"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5021589351"],"corresponding_institution_ids":["https://openalex.org/I13955877"],"apc_list":null,"apc_paid":null,"fwci":0.7188,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74365065,"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":"25"},"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.9995999932289124,"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.9995999932289124,"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.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7691338062286377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5493542551994324},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5347496867179871},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5195179581642151},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5070993900299072},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.49857473373413086},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47283560037612915},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.44670072197914124},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4448162913322449},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43557652831077576},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40869638323783875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40600934624671936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3901351988315582},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.29434746503829956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17246770858764648}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7691338062286377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5493542551994324},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5347496867179871},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5195179581642151},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5070993900299072},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.49857473373413086},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47283560037612915},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.44670072197914124},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4448162913322449},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43557652831077576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40869638323783875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40600934624671936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3901351988315582},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.29434746503829956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17246770858764648},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2843944","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2843944","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.8950","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.8950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/um/people/roysch/Papers/ANGAP-AFHKSSST13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W123178497","https://openalex.org/W1680189815","https://openalex.org/W1993416417","https://openalex.org/W2000444555","https://openalex.org/W2011039300","https://openalex.org/W2013198217","https://openalex.org/W2014369282","https://openalex.org/W2018702852","https://openalex.org/W2028081955","https://openalex.org/W2033885045","https://openalex.org/W2042276676","https://openalex.org/W2054428995","https://openalex.org/W2066671865","https://openalex.org/W2071016718","https://openalex.org/W2072291569","https://openalex.org/W2109309418","https://openalex.org/W2115777319","https://openalex.org/W2120024198","https://openalex.org/W2126307323","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2621717961","https://openalex.org/W2770775905","https://openalex.org/W4231286762","https://openalex.org/W4241273708","https://openalex.org/W4248079359"],"related_works":["https://openalex.org/W4252399622","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2950365512","https://openalex.org/W3009979748","https://openalex.org/W1608444752","https://openalex.org/W4299580661","https://openalex.org/W3204684126","https://openalex.org/W2062310236"],"abstract_inverted_index":{"We":[0,20,123,209],"study":[1,126],"a":[2,23,32,48,77,101,105,132,167,178,185,192,202,211],"variant":[3],"of":[4,25,34,73,85,91,104,107,127,158,170,188,206,223,229,252],"the":[5,70,74,108,111,115,125,207,227,236,249],"generalized":[6],"assignment":[7],"problem":[8],"(":[9,17],"gap":[10,16],"),":[11],"which":[12,154,239],"we":[13,190,244],"label":[14],"all-or-nothing":[15],"agap":[18,128,148,171,182,224,253],").":[19],"are":[21,94],"given":[22],"set":[24,33],"items,":[26],"partitioned":[27],"into":[28],"n":[29],"groups,":[30],"and":[31,46],"m":[35,161],"bins.":[36],"Each":[37,59],"item":[38,66,231],"\u2113":[39,43,49],"has":[40],"size":[41,72],"s":[42],">":[44],"0,":[45],"utility":[47,117,228],"j":[50,57],"\u2a7e":[51],"0":[52],"if":[53,89],"packed":[54],"in":[55,76,110,135,151,153,238,255],"bin":[56,60,78,237],".":[58],"can":[61],"accommodate":[62],"at":[63,159],"most":[64,160],"one":[65],"from":[67,118],"each":[68,155],"group;":[69],"total":[71,116],"items":[75,86,93,109],"cannot":[79],"exceed":[80],"its":[81,92],"capacity.":[82],"A":[83],"group":[84,156],"is":[87,98,121,142,241],"satisfied":[88,119],"all":[90],"packed.":[95,242],"The":[96],"goal":[97],"to":[99,172,177],"find":[100],"feasible":[102],"packing":[103],"subset":[106],"bins":[112],"such":[113],"that":[114],"groups":[120],"maximized.":[122],"motivate":[124],"by":[129],"pointing":[130],"out":[131],"central":[133],"application":[134],"scheduling":[136],"advertising":[137],"campaigns.":[138],"Our":[139,164],"main":[140],"result":[141],"an":[143],"O":[144],"(1)-approximation":[145],"algorithm":[146,165],"for":[147,219,248],"instances":[149,183],"arising":[150],"practice,":[152],"consists":[157],"/2":[162],"items.":[163],"uses":[166],"novel":[168],"reduction":[169],"maximizing":[173],"submodular":[174],"function":[175],"subject":[176],"matroid":[179],"constraint.":[180],"For":[181],"with":[184],"fixed":[186],"number":[187],"bins,":[189],"develop":[191],"randomized":[193],"polynomial":[194],"time":[195],"approximation":[196],"scheme":[197],"(PTAS)":[198],",":[199,225],"relying":[200],"on":[201,235],"nontrivial":[203],"LP":[204],"relaxation":[205],"problem.":[208],"present":[210],"(3":[212],"+":[213],"\u03b5)-approximation":[214],"as":[215,217],"well":[216],"PTASs":[218],"other":[220],"special":[221],"cases":[222],"where":[226],"any":[230],"does":[232],"not":[233],"depend":[234],"it":[240],"Finally,":[243],"derive":[245],"hardness":[246],"results":[247],"different":[250],"variants":[251],"studied":[254],"this":[256],"paper.":[257]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}