{"id":"https://openalex.org/W4385335655","doi":"https://doi.org/10.1137/19m125515x","title":"Deterministic \\(\\boldsymbol{(\\unicode{x00BD}+\\varepsilon)}\\) -Approximation for Submodular Maximization over a Matroid","display_name":"Deterministic \\(\\boldsymbol{(\\unicode{x00BD}+\\varepsilon)}\\) -Approximation for Submodular Maximization over a Matroid","publication_year":2023,"publication_date":"2023-07-27","ids":{"openalex":"https://openalex.org/W4385335655","doi":"https://doi.org/10.1137/19m125515x"},"language":"en","primary_location":{"id":"doi:10.1137/19m125515x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m125515x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Statistics and Operations Research Department, Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":"https://orcid.org/0000-0002-7014-8954","affiliations":[{"raw_affiliation_string":"Statistics and Operations Research Department, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"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/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]},{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moran Feldman","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Raanana, Israel. Current address: Department of Computer Science, University of Haifa, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0002-1535-2979","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Raanana, Israel. Current address: Department of Computer Science, University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I164950643","https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102805567","display_name":"Mohit Garg","orcid":"https://orcid.org/0000-0003-1230-4821"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Mohit Garg","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Raanana, Israel. Current address: Department of Computer Science and Automation, Indian Institute of Science, Bengaluru, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Raanana, Israel. Current address: Department of Computer Science and Automation, Indian Institute of Science, Bengaluru, India","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.5819,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70950611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"52","issue":"4","first_page":"945","last_page":"967"},"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.9998999834060669,"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.9998999834060669,"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.9969000220298767,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9163569211959839},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9100059270858765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6977758407592773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6865196824073792},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6795727610588074},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6299502849578857},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5101678371429443},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5084308981895447},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4963997006416321},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4789055585861206},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.44834089279174805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26680123805999756},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.24056753516197205},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.08780956268310547}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9163569211959839},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9100059270858765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6977758407592773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6865196824073792},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6795727610588074},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6299502849578857},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5101678371429443},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5084308981895447},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4963997006416321},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4789055585861206},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.44834089279174805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26680123805999756},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.24056753516197205},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.08780956268310547},{"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":[{"id":"doi:10.1137/19m125515x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m125515x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1059407220","display_name":null,"funder_award_id":"2018352","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G4302579884","display_name":null,"funder_award_id":"2233/19","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G7746946551","display_name":null,"funder_award_id":"1357/16","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W8905951","https://openalex.org/W1997783781","https://openalex.org/W2027176632","https://openalex.org/W2049451257","https://openalex.org/W2053381548","https://openalex.org/W2056561663","https://openalex.org/W2064933851","https://openalex.org/W2118947995","https://openalex.org/W2132651631","https://openalex.org/W2179494254","https://openalex.org/W2569511777","https://openalex.org/W2757107770","https://openalex.org/W2951195910","https://openalex.org/W2988480584","https://openalex.org/W3160905013"],"related_works":["https://openalex.org/W2951569895","https://openalex.org/W4255179538","https://openalex.org/W2883525063","https://openalex.org/W2964314169","https://openalex.org/W2902154658","https://openalex.org/W2735578456","https://openalex.org/W2967815998","https://openalex.org/W4287330672","https://openalex.org/W2883312497","https://openalex.org/W4385327858"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,24,32,40,44],"problem":[3,25],"of":[4,43],"maximizing":[5],"a":[6,12,17],"monotone":[7],"submodular":[8],"function":[9],"subject":[10],"to":[11,37],"matroid":[13],"constraint":[14],"and":[15,52],"present":[16],"deterministic":[18,34],"algorithm":[19,30,35,47],"that":[20],"achieves":[21],"-approximation":[22,41],"for":[23],"(for":[26],"some":[27],").":[28],"This":[29],"is":[31],"first":[33],"known":[36],"improve":[38],"over":[39],"ratio":[42],"classical":[45],"greedy":[46],"proved":[48],"by":[49],"Nemhauser,":[50],"Wolsey,":[51],"Fisher":[53],"in":[54],"1978.":[55]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}