{"id":"https://openalex.org/W4378531166","doi":"https://doi.org/10.1007/978-3-031-33377-4_41","title":"Stochastic Submodular Maximization via\u00a0Polynomial Estimators","display_name":"Stochastic Submodular Maximization via\u00a0Polynomial Estimators","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4378531166","doi":"https://doi.org/10.1007/978-3-031-33377-4_41"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-33377-4_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-33377-4_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5103272492","display_name":"G\u00f6zde \u00d6zcan","orcid":"https://orcid.org/0000-0002-2957-6893"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G\u00f6zde \u00d6zcan","raw_affiliation_strings":["Electrical and Computer Engineering Department, Northeastern University, Boston, MA, 02115, USA"],"raw_orcid":"https://orcid.org/0000-0002-2957-6893","affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Northeastern University, Boston, MA, 02115, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049931304","display_name":"Stratis Ioannidis","orcid":"https://orcid.org/0000-0001-8355-4751"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stratis Ioannidis","raw_affiliation_strings":["Electrical and Computer Engineering Department, Northeastern University, Boston, MA, 02115, USA"],"raw_orcid":"https://orcid.org/0000-0001-8355-4751","affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Northeastern University, Boston, MA, 02115, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103272492"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4722,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49318139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"535","last_page":"548"},"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.9995999932289124,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987000226974487,"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":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.928271472454071},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7364016771316528},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.5983555316925049},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5473858714103699},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5353620052337646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5203642249107361},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4951912462711334},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4721897840499878},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.4617704451084137},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.44374731183052063},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42108237743377686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3854876160621643},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.326140433549881},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3076208233833313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2342560887336731},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10712042450904846}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.928271472454071},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7364016771316528},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.5983555316925049},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5473858714103699},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5353620052337646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5203642249107361},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4951912462711334},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4721897840499878},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.4617704451084137},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.44374731183052063},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42108237743377686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3854876160621643},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.326140433549881},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3076208233833313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2342560887336731},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10712042450904846},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-33377-4_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-33377-4_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1500676409","https://openalex.org/W1526762477","https://openalex.org/W1680189815","https://openalex.org/W1989453388","https://openalex.org/W1991635064","https://openalex.org/W2061820396","https://openalex.org/W2072291569","https://openalex.org/W2108858998","https://openalex.org/W2132651631","https://openalex.org/W2963653884","https://openalex.org/W3111397019","https://openalex.org/W3123558218","https://openalex.org/W4378531166"],"related_works":["https://openalex.org/W4252399622","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2923536170","https://openalex.org/W2352672974","https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W3204684126"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}