{"id":"https://openalex.org/W4412481751","doi":"https://doi.org/10.1145/3694906.3743319","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","display_name":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412481751","doi":"https://doi.org/10.1145/3694906.3743319"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743319","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743319","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044510135","display_name":"Jakub \u0141\u0105cki","orcid":"https://orcid.org/0000-0001-9347-0041"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jakub \u0141\u0105cki","raw_affiliation_strings":["Google Research, New York, USA"],"raw_orcid":"https://orcid.org/0000-0001-9347-0041","affiliations":[{"raw_affiliation_string":"Google Research, New York, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043479522","display_name":"Slobodan Mitrovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["UC Davis, Davis, USA, University of Novi Sad, Novi Sad, Serbia"],"raw_orcid":"https://orcid.org/0009-0003-9269-4379","affiliations":[{"raw_affiliation_string":"UC Davis, Davis, USA, University of Novi Sad, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014772590","display_name":"Srikkanth Ramachandran","orcid":"https://orcid.org/0000-0003-2392-1999"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srikkanth Ramachandran","raw_affiliation_strings":["UC Davis, Davis, USA"],"raw_orcid":"https://orcid.org/0000-0003-2392-1999","affiliations":[{"raw_affiliation_string":"UC Davis, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092873257","display_name":"Wen-Horng Sheu","orcid":"https://orcid.org/0000-0002-2707-8612"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wen-Horng Sheu","raw_affiliation_strings":["UC Davis, Davis, USA"],"raw_orcid":"https://orcid.org/0000-0002-2707-8612","affiliations":[{"raw_affiliation_string":"UC Davis, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044510135"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":1.3517,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83806005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.5997754335403442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5197955369949341},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3550768494606018},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29903024435043335}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5997754335403442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5197955369949341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3550768494606018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29903024435043335}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743319","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743319","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G289180251","display_name":"CAREER: Fast Scalable Graph Algorithms","funder_award_id":"2340048","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/W4412481751.pdf","grobid_xml":"https://content.openalex.org/works/W4412481751.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1578666690","https://openalex.org/W1916752577","https://openalex.org/W2051586153","https://openalex.org/W2074803875","https://openalex.org/W2112741516","https://openalex.org/W2153977620","https://openalex.org/W2173213060","https://openalex.org/W2186715137","https://openalex.org/W2499493239","https://openalex.org/W2734687249","https://openalex.org/W2767578875","https://openalex.org/W2788015272","https://openalex.org/W2804815917","https://openalex.org/W2909539666","https://openalex.org/W2951940772","https://openalex.org/W2963813153","https://openalex.org/W2971407628","https://openalex.org/W2972236337","https://openalex.org/W3092879920","https://openalex.org/W3095269607","https://openalex.org/W3109308412","https://openalex.org/W3133823038","https://openalex.org/W3176389256","https://openalex.org/W3183684990","https://openalex.org/W4285013187","https://openalex.org/W4313071422","https://openalex.org/W4402701290","https://openalex.org/W4412481751","https://openalex.org/W6679841183"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"We":[0,40],"study":[1],"the":[2,6,22,38,49,72,75],"allocation":[3,123],"problem":[4,13],"in":[5,20,33,53,126],"Massively":[7],"Parallel":[8],"Computation":[9],"(MPC)":[10],"model.":[11],"This":[12],"is":[14,24,71,80],"a":[15,25,42,84,88],"special":[16],"case":[17],"of":[18,37,74,87],"b-matching":[19],"which":[21,51,98],"input":[23,76],"bipartite":[26],"graph":[27],"with":[28,136],"capacities":[29],"greater":[30],"than":[31],"1":[32],"only":[34],"one":[35],"part":[36],"bipartition.":[39],"give":[41],"(1":[43],"+":[44],"\u03f5)":[45],"approximate":[46],"algorithm":[47,90,120],"for":[48,121,134],"problem,":[50],"runs":[52],"\u00d5":[54,65],"(\u221along":[55],"\u03bb)":[56],"MPC":[57,132],"rounds,":[58],"using":[59],"sublinear":[60,130],"space":[61,131],"per":[62],"machine":[63],"and":[64,94],"(\u03bbn)":[66],"total":[67],"space,":[68],"where":[69],"\u03bb":[70],"arboricity":[73],"graph.":[77],"Our":[78],"result":[79],"obtained":[81],"by":[82,91],"providing":[83],"new":[85],"analysis":[86],"LOCAL":[89,128],"Agrawal,":[92],"Zadimoghaddam,":[93],"Mirrokni":[95],"[ICML":[96],"2018],":[97],"improves":[99],"its":[100],"round":[101,119],"complexity":[102],"from":[103],"O":[104,108],"(log":[105,109,117],"n)":[106,118],"to":[107,112],"\u03bb).":[110],"Prior":[111],"our":[113],"work,":[114],"no":[115],"o":[116],"constant-approximate":[122],"was":[124],"known":[125],"either":[127],"or":[129],"models":[133],"graphs":[135],"low":[137],"arboricity.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}