{"id":"https://openalex.org/W2066115687","doi":"https://doi.org/10.1145/2755573.2764965","title":"The Revolution in Graph Theoretic Optimization Problems","display_name":"The Revolution in Graph Theoretic Optimization Problems","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2066115687","doi":"https://doi.org/10.1145/2755573.2764965","mag":"2066115687"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2764965","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2764965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5010457003","display_name":"Gary L. Miller","orcid":"https://orcid.org/0000-0001-5456-8097"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gary L. Miller","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010457003"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.07416103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"181","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9904999732971191,"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.9904999732971191,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9902999997138977,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9901000261306763,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5832362771034241},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5695239305496216},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4892275333404541},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48717162013053894},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4368826746940613},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4313495457172394},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41567325592041016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33841803669929504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29505813121795654},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2306758165359497}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5832362771034241},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5695239305496216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4892275333404541},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48717162013053894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4368826746940613},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4313495457172394},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41567325592041016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33841803669929504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29505813121795654},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2306758165359497}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2755573.2764965","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2764965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5364081005","display_name":null,"funder_award_id":"CCF-1018463 and CCF_1065106","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/W4235911878","https://openalex.org/W1994341438","https://openalex.org/W2353784394","https://openalex.org/W2089521921","https://openalex.org/W2532801570","https://openalex.org/W4385627933","https://openalex.org/W2569496247","https://openalex.org/W2480127678","https://openalex.org/W4288641187","https://openalex.org/W2907276331"],"abstract_inverted_index":{"Over":[0],"the":[1,11,22,54],"last":[2],"several":[3],"years":[4],"there":[5],"have":[6],"been":[7],"major":[8],"breakthroughs":[9],"in":[10,25,38,60],"design":[12],"of":[13,56],"approximation":[14],"algorithms":[15],"for":[16,30],"such":[17],"classic":[18],"problems":[19],"as":[20],"finding":[21],"maximum":[23],"flow":[24,29],"a":[26,57],"graph.":[27],"Maximum":[28],"undirected":[31],"graphs":[32],"can":[33],"now":[34],"be":[35],"approximately":[36],"solved":[37],"almost":[39],"linear":[40],"time.":[41],"This":[42],"result":[43],"by":[44],"researchers":[45],"at":[46],"Berkeley":[47],"and":[48],"MIT,":[49],"I":[50],"claim,":[51],"is":[52],"only":[53],"beginning":[55],"new":[58],"era":[59],"efficient":[61],"algorithm":[62],"design.":[63]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}