{"id":"https://openalex.org/W2899827320","doi":"https://doi.org/10.1145/3313276.3316389","title":"Submodular maximization with matroid and packing constraints in parallel","display_name":"Submodular maximization with matroid and packing constraints in parallel","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2899827320","doi":"https://doi.org/10.1145/3313276.3316389","mag":"2899827320"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316389","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316389","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316389","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316389","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Ene","orcid":"https://orcid.org/0000-0002-5818-1807"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alina Ene","raw_affiliation_strings":["Boston University, USA","Boston University , USA"],"affiliations":[{"raw_affiliation_string":"Boston University, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Boston University , USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102936404","display_name":"Huy L. Nguy\u00ean","orcid":"https://orcid.org/0000-0001-5128-6545"},"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":"Huy L. Nguy\u1ec5n","raw_affiliation_strings":["Northeastern University, USA","Northeastern University,  USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University,  USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091392485","display_name":"Adrian Vladu","orcid":"https://orcid.org/0009-0006-1169-3158"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adrian Vladu","raw_affiliation_strings":["Boston University, USA","Boston University , USA"],"affiliations":[{"raw_affiliation_string":"Boston University, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Boston University , USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025907388"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.7999,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.73757477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"90","last_page":"101"},"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.9994999766349792,"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.9994999766349792,"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.9595000147819519,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.953000009059906,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9496331810951233},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8662519454956055},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7306180596351624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6519105434417725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6402908563613892},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4896140694618225},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4757271111011505},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46026355028152466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4557802379131317},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.445868581533432},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43872788548469543},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24958547949790955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23466017842292786},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.0728006660938263}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9496331810951233},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8662519454956055},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7306180596351624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6519105434417725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6402908563613892},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4896140694618225},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4757271111011505},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46026355028152466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4557802379131317},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.445868581533432},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43872788548469543},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24958547949790955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23466017842292786},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0728006660938263},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3313276.3316389","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316389","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316389","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1808.09987","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.09987","pdf_url":"https://arxiv.org/pdf/1808.09987","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2899827320","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1808.09987","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1808.09987","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1808.09987","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3313276.3316389","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316389","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316389","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1678081061","display_name":null,"funder_award_id":"1750716","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G410645175","display_name":"AF:Small: Continuous Perspectives on Accelerated Methods for Combinatorial Optimization","funder_award_id":"1718342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7280006071","display_name":null,"funder_award_id":"CCF-1750333,CCF-1718342,CCF-1750716","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8193185572","display_name":"CAREER: New Algorithms for Submodular Optimization","funder_award_id":"1750333","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2899827320.pdf","grobid_xml":"https://content.openalex.org/works/W2899827320.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1910435774","https://openalex.org/W1989453388","https://openalex.org/W2007111443","https://openalex.org/W2027758271","https://openalex.org/W2035442052","https://openalex.org/W2037568170","https://openalex.org/W2045492898","https://openalex.org/W2063241141","https://openalex.org/W2101246692","https://openalex.org/W2132651631","https://openalex.org/W2163656645","https://openalex.org/W2170735271","https://openalex.org/W2188731843","https://openalex.org/W2436982461","https://openalex.org/W2543273498","https://openalex.org/W2611972874","https://openalex.org/W2621717961","https://openalex.org/W2796716148","https://openalex.org/W2797074460","https://openalex.org/W2803199317","https://openalex.org/W2803533106","https://openalex.org/W2809318113","https://openalex.org/W2883693373","https://openalex.org/W2949731556","https://openalex.org/W2951079895","https://openalex.org/W2952024675","https://openalex.org/W2952567852","https://openalex.org/W2962908181","https://openalex.org/W2963166012","https://openalex.org/W2963719189","https://openalex.org/W6730603623"],"related_works":["https://openalex.org/W2953374984","https://openalex.org/W2901500837","https://openalex.org/W2797074460","https://openalex.org/W2951569895","https://openalex.org/W2902154658","https://openalex.org/W2963201732","https://openalex.org/W2964501918","https://openalex.org/W3013568067","https://openalex.org/W3081747061","https://openalex.org/W2883816296","https://openalex.org/W3086956769","https://openalex.org/W2883071313","https://openalex.org/W3101270593","https://openalex.org/W3188045078","https://openalex.org/W3048806178","https://openalex.org/W3035443347","https://openalex.org/W3017286006","https://openalex.org/W3155850186","https://openalex.org/W2952164293","https://openalex.org/W2252172643"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,6],"problem":[3],"of":[4,9,26,29],"maximizing":[5],"multilinear":[7],"extension":[8],"a":[10,14,23],"submodular":[11],"function":[12],"subject":[13],"single":[15],"matroid":[16],"constraint":[17],"or":[18],"multiple":[19],"packing":[20],"constraints":[21],"with":[22],"small":[24],"number":[25],"adaptive":[27],"rounds":[28],"evaluation":[30],"queries.":[31]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}