{"id":"https://openalex.org/W2944048840","doi":"https://doi.org/10.1145/3310273.3323431","title":"Parallel algorithms through approximation","display_name":"Parallel algorithms through approximation","publication_year":2019,"publication_date":"2019-04-30","ids":{"openalex":"https://openalex.org/W2944048840","doi":"https://doi.org/10.1145/3310273.3323431","mag":"2944048840"},"language":"en","primary_location":{"id":"doi:10.1145/3310273.3323431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3310273.3323431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5055182869","display_name":"Alex Pothen","orcid":"https://orcid.org/0000-0002-3421-3325"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alex Pothen","raw_affiliation_strings":["Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055182869"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"340","last_page":"340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7570862770080566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6680426597595215},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6275204420089722},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5515567660331726},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.465949147939682},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44554439187049866},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4271787405014038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25436660647392273},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1459452509880066}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7570862770080566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6680426597595215},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6275204420089722},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5515567660331726},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.465949147939682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44554439187049866},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4271787405014038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25436660647392273},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1459452509880066},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3310273.3323431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3310273.3323431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6762595189","display_name":"AitF:Collaborative Research: Bridging the Gap between Theory and Practice for Matching and Edge Cover Problems","funder_award_id":"1637534","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1490475243","https://openalex.org/W1500698072","https://openalex.org/W2477549100","https://openalex.org/W2165420145","https://openalex.org/W1534072310","https://openalex.org/W189995875","https://openalex.org/W2019306084","https://openalex.org/W1965255372","https://openalex.org/W2100107618","https://openalex.org/W2460498097"],"abstract_inverted_index":{"We":[0,50],"describe":[1],"a":[2,18,31],"paradigm":[3],"for":[4,21],"designing":[5],"parallel":[6,24],"algorithms":[7,25,44],"on":[8],"massive":[9],"graphs":[10],"by":[11],"employing":[12],"approximation":[13,35,38,43],"techniques.":[14],"Instead":[15],"of":[16,48,54,60],"solving":[17],"problem":[19],"exactly,":[20],"which":[22],"efficient":[23],"do":[26],"not":[27],"exist,":[28],"we":[29,41],"seek":[30],"solution":[32],"with":[33,45],"provable":[34],"guarantees":[36],"via":[37],"algorithms.":[39],"Furthermore,":[40],"design":[42],"high":[46],"degrees":[47],"concurrency.":[49],"show":[51],"the":[52],"computation":[53],"degree-constrained":[55],"subgraphs":[56],"as":[57],"an":[58],"example":[59],"this":[61],"paradigm.":[62]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}