{"id":"https://openalex.org/W2611872949","doi":"https://doi.org/10.1109/globalsip.2016.7906050","title":"Submodular maximization with multi-knapsack constraints and its applications in scientific literature recommendations","display_name":"Submodular maximization with multi-knapsack constraints and its applications in scientific literature recommendations","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2611872949","doi":"https://doi.org/10.1109/globalsip.2016.7906050","mag":"2611872949"},"language":"en","primary_location":{"id":"doi:10.1109/globalsip.2016.7906050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globalsip.2016.7906050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","raw_type":"proceedings-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/A5102990734","display_name":"Qilian Yu","orcid":"https://orcid.org/0000-0003-3990-2098"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qilian Yu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Davis, CA, USA","Department of Electrical and Computer Engineering,University of California,Davis,CA 95616 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering,University of California,Davis,CA 95616 USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080957110","display_name":"Li Xu","orcid":"https://orcid.org/0000-0002-2779-3595"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Easton Li Xu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University, TX, USA","Department of Electrical and Computer Engineering Texas A&M University College Station TX 77843 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering Texas A&M University College Station TX 77843 USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009164482","display_name":"Shuguang Cui","orcid":"https://orcid.org/0000-0003-2608-775X"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shuguang Cui","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Davis, CA, USA","Department of Electrical and Computer Engineering,University of California,Davis,CA 95616 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering,University of California,Davis,CA 95616 USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102990734"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":null,"apc_paid":null,"fwci":2.4393,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.90489683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1295","last_page":"1299"},"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.9997000098228455,"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.9997000098228455,"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.9955999851226807,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9505751132965088},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9154393076896667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6755343079566956},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6464591026306152},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6423255205154419},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6130928993225098},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5889145135879517},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5375653505325317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5130733251571655},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.44114840030670166},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4406229853630066},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41260528564453125},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4105342626571655},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27078160643577576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.224654883146286},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21697616577148438},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.21555805206298828}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9505751132965088},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9154393076896667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6755343079566956},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6464591026306152},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6423255205154419},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6130928993225098},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5889145135879517},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5375653505325317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5130733251571655},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.44114840030670166},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4406229853630066},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41260528564453125},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4105342626571655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27078160643577576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.224654883146286},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21697616577148438},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.21555805206298828},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globalsip.2016.7906050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globalsip.2016.7906050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1579799841","https://openalex.org/W1595301768","https://openalex.org/W1680189815","https://openalex.org/W1757790940","https://openalex.org/W1962684803","https://openalex.org/W1997959284","https://openalex.org/W2032408534","https://openalex.org/W2033885045","https://openalex.org/W2088011174","https://openalex.org/W2101246692","https://openalex.org/W2102870745","https://openalex.org/W2116655493","https://openalex.org/W2120173366","https://openalex.org/W2141403143","https://openalex.org/W2170735271","https://openalex.org/W2244083851","https://openalex.org/W2300836882","https://openalex.org/W4231490457","https://openalex.org/W4248079359","https://openalex.org/W4285719527","https://openalex.org/W6634582008","https://openalex.org/W6635669390","https://openalex.org/W6637754763","https://openalex.org/W6641263247"],"related_works":["https://openalex.org/W2923536170","https://openalex.org/W2788127768","https://openalex.org/W1608444752","https://openalex.org/W2963443186","https://openalex.org/W2950365512","https://openalex.org/W3204684126","https://openalex.org/W4382197677","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W2799046353"],"abstract_inverted_index":{"Submodular":[0],"maximization":[1],"problems":[2,10],"belong":[3],"to":[4,30],"the":[5,21,48,59,64,67,75,92],"family":[6],"of":[7,23,47,77,106],"combinatorial":[8],"optimization":[9],"and":[11,100],"enjoy":[12],"wide":[13],"applications.":[14],"In":[15,69],"this":[16],"paper,":[17],"we":[18,36,72],"focus":[19],"on":[20],"problem":[22],"maximizing":[24],"a":[25,31,38,43],"monotone":[26],"submodular":[27],"function":[28],"subject":[29],"d-knapsack":[32],"constraint,":[33],"for":[34],"which":[35],"propose":[37],"streaming":[39,94],"algorithm":[40,80,95],"that":[41,91],"achieves":[42,96],"(1/1+2d":[44],"-":[45],"\u03f5)-approximation":[46],"optimal":[49],"value,":[50],"while":[51],"it":[52],"only":[53],"needs":[54],"one":[55],"single":[56],"pass":[57],"through":[58],"dataset":[60],"without":[61],"storing":[62],"all":[63],"data":[65],"in":[66,84],"memory.":[68],"our":[70,78],"experiments,":[71],"extensively":[73],"evaluate":[74],"effectiveness":[76],"proposed":[79,93],"via":[81],"an":[82],"application":[83],"scientific":[85],"literature":[86],"recommendation.":[87],"It":[88],"is":[89],"observed":[90],"both":[97],"execution":[98],"speedup":[99],"memory":[101],"saving":[102],"by":[103],"several":[104],"orders":[105],"magnitude,":[107],"compared":[108],"with":[109],"existing":[110],"approaches.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}