{"id":"https://openalex.org/W2968895370","doi":"https://doi.org/10.1137/16m1107644","title":"Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint","display_name":"Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2968895370","doi":"https://doi.org/10.1137/16m1107644","mag":"2968895370"},"language":"en","primary_location":{"id":"doi:10.1137/16m1107644","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1107644","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/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I4210166566","display_name":"Preferred Networks (Japan)","ror":"https://ror.org/05xeefy56","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210166566"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["National Institute of Informatics and Preferred Infrastructure, Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics and Preferred Infrastructure, Inc","institution_ids":["https://openalex.org/I4210166566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038701345"],"corresponding_institution_ids":["https://openalex.org/I4210166566"],"apc_list":null,"apc_paid":null,"fwci":2.3137,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.89631154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"33","issue":"3","first_page":"1452","last_page":"1471"},"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.9994000196456909,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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.9424985647201538},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8772774934768677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8117181658744812},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6460705995559692},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6050636172294617},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5816333293914795},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5784183740615845},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.528940737247467},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5268812775611877},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.4836479425430298},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4646984934806824},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4517230689525604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3408587872982025},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10417938232421875}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9424985647201538},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8772774934768677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8117181658744812},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6460705995559692},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6050636172294617},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5816333293914795},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5784183740615845},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.528940737247467},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5268812775611877},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.4836479425430298},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4646984934806824},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4517230689525604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3408587872982025},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10417938232421875},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1107644","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1107644","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":[{"display_name":"Decent work and economic growth","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G4017703114","display_name":null,"funder_award_id":"24106003","funder_id":"https://openalex.org/F4320320912","funder_display_name":"Ministry of Education, Culture, Sports, Science and Technology"},{"id":"https://openalex.org/G5730542316","display_name":"Research on Approximation Algorithms for Satisfiable Constraint Satisfaction Problems","funder_award_id":"26730009","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7410091438","display_name":null,"funder_award_id":"24106003","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320320912","display_name":"Ministry of Education, Culture, Sports, Science and Technology","ror":"https://ror.org/048rj2z13"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2011193572","https://openalex.org/W2033885045","https://openalex.org/W2132651631","https://openalex.org/W2143996311"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W1556368910","https://openalex.org/W2799046353","https://openalex.org/W1984121220","https://openalex.org/W2900218461","https://openalex.org/W2923536170","https://openalex.org/W2222484777","https://openalex.org/W2098281589","https://openalex.org/W3155769677"],"abstract_inverted_index":{"We":[0,14],"consider":[1],"the":[2,38,42,59,66,75,104],"problem":[3,107],"of":[4,41,61,95],"maximizing":[5],"a":[6,11,25,70,100],"monotone":[7],"submodular":[8,90],"function":[9],"under":[10],"knapsack":[12,71],"constraint.":[13],"show":[15],"that,":[16],"for":[17,53,69,88,103],"any":[18,54],"fixed":[19],"$\\epsilon":[20],">":[21],"0$,":[22],"there":[23],"exists":[24],"polynomial-time":[26,101],"algorithm":[27,102],"with":[28,108],"an":[29,79,93,109],"approximation":[30,46,80,111],"ratio":[31,47,81],"$1-c/e-\\epsilon$,":[32],"where":[33],"$c":[34,55],"\\in":[35,56],"[0,1]$":[36],"is":[37,48,65,86],"(total)":[39],"curvature":[40,76],"input":[43],"function.":[44],"This":[45],"tight":[49,87],"up":[50],"to":[51,77],"$\\epsilon$":[52],"[0,1]$.":[57],"To":[58],"best":[60],"our":[62,96],"knowledge,":[63],"this":[64],"first":[67],"result":[68],"constraint":[72],"that":[73],"incorporates":[74],"obtain":[78],"better":[82],"than":[83],"$1-1/e$,":[84],"which":[85],"general":[89],"functions.":[91],"As":[92],"application":[94],"result,":[97],"we":[98],"present":[99],"budget":[105],"allocation":[106],"improved":[110],"ratio.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-13T07:31:44.756512","created_date":"2025-10-10T00:00:00"}