{"id":"https://openalex.org/W3118541900","doi":"https://doi.org/10.1137/19m1277692","title":"Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization","display_name":"Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3118541900","doi":"https://doi.org/10.1137/19m1277692","mag":"3118541900"},"language":"en","primary_location":{"id":"doi:10.1137/19m1277692","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1277692","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5111570860","display_name":"Hiroki Oshima","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroki Oshima","raw_affiliation_strings":["Department of Mathematical Informatics, Graduate School of Information Science and Technol-ogy, The University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Informatics, Graduate School of Information Science and Technol-ogy, The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111570860"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":2.8114,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91381219,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"35","issue":"1","first_page":"1","last_page":"22"},"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.9998000264167786,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9850999712944031,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9558969140052795},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6616835594177246},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6605785489082336},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6388731002807617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6294534206390381},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5522748827934265},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5517687797546387},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5314732193946838},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48205408453941345},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.46308547258377075},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.4560735821723938},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4245387315750122},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3591143488883972},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2781442105770111},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.247304767370224},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06284883618354797}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9558969140052795},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6616835594177246},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6605785489082336},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6388731002807617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6294534206390381},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5522748827934265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5517687797546387},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5314732193946838},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48205408453941345},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.46308547258377075},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.4560735821723938},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4245387315750122},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3591143488883972},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2781442105770111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.247304767370224},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06284883618354797},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1277692","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1277692","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1771852678","https://openalex.org/W1972946082","https://openalex.org/W2012329067","https://openalex.org/W2035575256","https://openalex.org/W2053381548","https://openalex.org/W2128059732","https://openalex.org/W2179494254"],"related_works":["https://openalex.org/W4385627918","https://openalex.org/W4252399622","https://openalex.org/W4235430592","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2506304636","https://openalex.org/W2966531942","https://openalex.org/W1608444752","https://openalex.org/W2950365512"],"abstract_inverted_index":{"Submodularity":[0],"is":[1,13],"one":[2],"of":[3,16,19,27,54,132],"the":[4,55,114,133],"most":[5],"important":[6],"properties":[7],"in":[8,52,118,130],"combinatorial":[9],"optimization,":[10],"and":[11,31,43,76,121,146,148],"$k$-submodularity":[12],"a":[14,20,69,77,98,106],"generalization":[15],"submodularity.":[17],"Maximization":[18],"$k$-submodular":[21,39,49,127],"function":[22,50,128],"requires":[23],"an":[24],"exponential":[25],"number":[26],"value":[28],"oracle":[29],"queries,":[30],"approximation":[32,46,124],"algorithms":[33,47,91,125],"have":[34],"been":[35],"studied.":[36],"For":[37],"unconstrained":[38],"maximization,":[40,51,129],"Iwata,":[41,119],"Tanigawa,":[42,120],"Yoshida,":[44,122],"[Improved":[45,123],"for":[48,73,81,92,100,110,126],"Proceedings":[53,131],"Twenty-Seventh":[56,134],"Annual":[57,135],"ACM-SIAM":[58,136],"Symposium":[59,137],"on":[60,138],"Discrete":[61,139],"Algorithms,":[62,140,152],"SIAM,":[63,141],"Philadelphia,":[64,142],"2016,":[65,143],"pp.":[66,144,155],"404--413]":[67,145],"gave":[68],"randomized":[70,78,90,107],"$k/(2k-1)$-approximation":[71],"algorithm":[72,80,96,109],"monotone":[74],"functions":[75],"1/2-approximation":[79],"nonmonotone":[82,93],"functions.":[83,94],"In":[84],"this":[85],"paper,":[86],"we":[87],"present":[88],"improved":[89],"Our":[95],"gives":[97],"$\\frac{k^2+1}{2k^2+1}$-approximation":[99],"$k\\geq":[101],"3$.":[102],"We":[103,112],"also":[104],"give":[105],"$\\frac{\\sqrt{17}-3}{2}$-approximation":[108],"$k=3$.":[111],"use":[113],"same":[115],"framework":[116],"used":[117],"Ward":[147],"\u017divn\u00fd":[149],"[ACM":[150],"Trans.":[151],"12":[153],"(2016),":[154],"46:1--47:26]":[156],"with":[157],"different":[158],"probabilities.":[159]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}