{"id":"https://openalex.org/W4255179538","doi":"https://doi.org/10.1137/1.9781611975482.16","title":"Deterministic (\u00bd + \u03b5)-Approximation for Submodular Maximization over a Matroid","display_name":"Deterministic (\u00bd + \u03b5)-Approximation for Submodular Maximization over a Matroid","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W4255179538","doi":"https://doi.org/10.1137/1.9781611975482.16"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611975482.16","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.16","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"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":"ebook platform"},"license":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"book-chapter","type_crossref":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.16","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niv Buchbinder","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044819853","display_name":"Moran Feldman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moran Feldman","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015964129","display_name":"Mohit Garg","orcid":"https://orcid.org/0000-0001-6563-3106"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohit Garg","raw_affiliation_string":"","raw_affiliation_strings":[]}],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":18,"cited_by_percentile_year":{"min":92,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"254"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.9989,"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":"Combinatorial Optimization and Complexity Theory","score":0.9989,"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/T10374","display_name":"Graph Theory and Algorithms","score":0.9704,"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":"Advanced Cryptographic Schemes and Protocols","score":0.9426,"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"}}],"keywords":[{"keyword":"submodular maximization","score":0.7448}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.95486945},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.918219},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.69344556},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6351298},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.62430423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6205504},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5992788},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5733642},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.54735255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48566067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4727971},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.41631594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41299826},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.10367289},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611975482.16","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.16","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"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":"ebook platform"},"license":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611975482.16","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.16","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"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":"ebook platform"},"license":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2512208967","https://openalex.org/W2400862597","https://openalex.org/W2159059797","https://openalex.org/W1984819493","https://openalex.org/W278334329","https://openalex.org/W1975978423","https://openalex.org/W2058489697","https://openalex.org/W2153065381","https://openalex.org/W2625145881","https://openalex.org/W2106233458"],"ngrams_url":"https://api.openalex.org/works/W4255179538/ngrams","abstract_inverted_index":{"We":[0],"study":[1],"the":[2,26,31,39,43],"problem":[3],"of":[4,42],"maximizing":[5],"a":[6,12,17],"monotone":[7],"submodular":[8],"function":[9],"subject":[10],"to":[11,36],"matroid":[13],"constraint":[14],"and":[15,51],"present":[16],"deterministic":[18,33],"algorithm":[19,29,34,46],"that":[20],"achieves":[21],"(\u00bd":[22],"+":[23],"\u03b5)-approximation":[24],"for":[25],"problem.":[27],"This":[28],"is":[30],"first":[32],"known":[35],"improve":[37],"over":[38],"\u00bd-approximation":[40],"ratio":[41],"classical":[44],"greedy":[45],"proved":[47],"by":[48],"Nemhauser,":[49],"Wolsely":[50],"Fisher":[52],"in":[53],"1978.MSC":[54],"codesSubmodular":[55],"optimizationmatroiddeterministic":[56],"algorithms":[57]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4255179538","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3}],"updated_date":"2024-03-22T05:35:04.281681","created_date":"2022-05-12"}