{"id":"https://openalex.org/W2795850823","doi":"https://doi.org/10.1145/3188745.3188904","title":"Holiest minimum-cost paths and flows in surface graphs","display_name":"Holiest minimum-cost paths and flows in surface graphs","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2795850823","doi":"https://doi.org/10.1145/3188745.3188904","mag":"2795850823"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188904","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188904","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188904","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188904","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042187195","display_name":"Jeff Erickson","orcid":"https://orcid.org/0000-0002-5253-2282"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeff Erickson","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA","[University of Illinois at Urbana-Champaign,USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[University of Illinois at Urbana-Champaign,USA]","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013518909","display_name":"Kyle Fox","orcid":"https://orcid.org/0000-0002-2446-8594"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kyle Fox","raw_affiliation_strings":["University of Texas at Dallas, USA","University of Texas at Dallas; USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, USA","institution_ids":[]},{"raw_affiliation_string":"University of Texas at Dallas; USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014447782","display_name":"Luvsandondov Lkhamsuren","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luvsandondov Lkhamsuren","raw_affiliation_strings":["Airbnb, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Airbnb, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1319","last_page":"1332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9966999888420105,"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/combinatorics","display_name":"Combinatorics","score":0.6930158138275146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.683134913444519},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5345900058746338},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.530636727809906},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5094514489173889},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.4756590723991394},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43453747034072876},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43169111013412476},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32103872299194336}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6930158138275146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.683134913444519},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5345900058746338},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.530636727809906},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5094514489173889},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.4756590723991394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43453747034072876},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43169111013412476},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32103872299194336}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3188745.3188904","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188904","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188904","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1804.01045","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.01045","pdf_url":"https://arxiv.org/pdf/1804.01045","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:2795850823","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1804.01045","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.1804.01045","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1804.01045","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.1145/3188745.3188904","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188904","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188904","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G158207034","display_name":null,"funder_award_id":"CCF-1408763,IIS-1408846,IIS-1447554,CCF-1513816,CCF-1546392,CCF-1527084,CCF-1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2528371460","display_name":"AF: Small: Allocation Algorithms in Online Systems","funder_award_id":"1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4252697786","display_name":null,"funder_award_id":"W911NF-15-1-0408","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G4707214446","display_name":null,"funder_award_id":"2012/229","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G4898802086","display_name":null,"funder_award_id":"CCF-1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5385673730","display_name":null,"funder_award_id":"W911NF-15-1-","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G5774808026","display_name":null,"funder_award_id":"IIS-1447554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5857933033","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5888227577","display_name":null,"funder_award_id":"CCF-1513816","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6161100724","display_name":"AF: Medium: Collaborative Research: Algorithmic Foundations for Trajectory Collection Analysis","funder_award_id":"1513816","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6655819997","display_name":"BIGDATA: Collaborative Research: F: From Data Geometries to Information Networks","funder_award_id":"1546392","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G696009523","display_name":"AF: Medium: Collaborative Research: Fast and accurate optimization in planar graphs and beyond","funder_award_id":"1408763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7291707221","display_name":null,"funder_award_id":"CCF-1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7446531716","display_name":"III: Medium: Collaborative Research: From Answering Questions to  Questioning Answers (and Questions)---Perturbation Analysis of  Database Queries","funder_award_id":"1408846","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8302925103","display_name":"BIGDATA: F: DKA: Collaborative Research: Dealing Efficiently with Big Social Network Data","funder_award_id":"1447554","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"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2795850823.pdf","grobid_xml":"https://content.openalex.org/works/W2795850823.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W594463866","https://openalex.org/W1481962790","https://openalex.org/W1496024985","https://openalex.org/W1526753291","https://openalex.org/W1527270374","https://openalex.org/W1551891681","https://openalex.org/W1964405437","https://openalex.org/W1965690159","https://openalex.org/W1969523663","https://openalex.org/W1969625919","https://openalex.org/W1971258090","https://openalex.org/W1976957234","https://openalex.org/W1980410492","https://openalex.org/W1980627447","https://openalex.org/W1988593903","https://openalex.org/W1992869351","https://openalex.org/W1995945094","https://openalex.org/W2006152944","https://openalex.org/W2008597108","https://openalex.org/W2009669213","https://openalex.org/W2014352902","https://openalex.org/W2022163094","https://openalex.org/W2024654848","https://openalex.org/W2030509174","https://openalex.org/W2034509988","https://openalex.org/W2039086323","https://openalex.org/W2040112642","https://openalex.org/W2052100496","https://openalex.org/W2056178482","https://openalex.org/W2066108505","https://openalex.org/W2070505654","https://openalex.org/W2073350357","https://openalex.org/W2078191188","https://openalex.org/W2078443814","https://openalex.org/W2093766264","https://openalex.org/W2103099082","https://openalex.org/W2106299112","https://openalex.org/W2109920117","https://openalex.org/W2126169066","https://openalex.org/W2139649317","https://openalex.org/W2147510331","https://openalex.org/W2166937960","https://openalex.org/W2169528473","https://openalex.org/W2199785256","https://openalex.org/W2326954772","https://openalex.org/W2485917574","https://openalex.org/W2569270235","https://openalex.org/W2610479830","https://openalex.org/W2741786970","https://openalex.org/W2762935521","https://openalex.org/W2764219506","https://openalex.org/W2800875754","https://openalex.org/W2963119423","https://openalex.org/W2963719527","https://openalex.org/W2963816213","https://openalex.org/W2964012127","https://openalex.org/W3040586665","https://openalex.org/W3101337733","https://openalex.org/W3139290474","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2964155548","https://openalex.org/W2083049364","https://openalex.org/W2101952975","https://openalex.org/W3098776817","https://openalex.org/W1581300568","https://openalex.org/W2110004664","https://openalex.org/W2921999720","https://openalex.org/W1485876617","https://openalex.org/W1604585469","https://openalex.org/W2963357303","https://openalex.org/W1426993502","https://openalex.org/W2152290683","https://openalex.org/W3212983994","https://openalex.org/W2963972775","https://openalex.org/W2006152944","https://openalex.org/W1987965173","https://openalex.org/W3034281291","https://openalex.org/W3037212114","https://openalex.org/W2538469359","https://openalex.org/W1525471909"],"abstract_inverted_index":{"Let":[0],"G":[1],"be":[2],"an":[3,12],"edge-weighted":[4,67],"directed":[5,66],"graph":[6],"with":[7],"n":[8,74],"vertices":[9,93],"embedded":[10,102,122],"on":[11,95],"orientable":[13],"surface":[14,101,121],"of":[15,29,85,99,116],"genus":[16,120],"g.":[17],"We":[18,44],"describe":[19],"a":[20,50,56,71,87,96,100,114],"simple":[21],"deterministic":[22,57,72,109],"lexicographic":[23],"perturbation":[24,47],"scheme":[25,48,78],"that":[26],"guarantees":[27],"uniqueness":[28],"minimum-cost":[30],"flows":[31],"and":[32,70],"shortest":[33,82,88],"paths":[34,83],"in":[35,49,65,118],"G.":[36],"The":[37,104],"perturbations":[38],"take":[39],"O(gn)":[40],"time":[41,60,76,111],"to":[42,54],"compute.":[43],"use":[45],"our":[46],"black":[51],"box":[52],"manner":[53],"derive":[55],"O(n":[58],"loglogn)":[59],"algorithm":[61],"for":[62,79,91,113],"minimum":[63],"cut":[64],"planar":[68],"graphs":[69],"O(g2":[73],"logn)":[75],"proprocessing":[77],"the":[80],"multiple-source":[81],"problem":[84],"computing":[86],"path":[89],"oracle":[90],"all":[92],"lying":[94],"common":[97],"face":[98],"graph.":[103],"latter":[105],"result":[106],"yields":[107],"faster":[108],"near-linear":[110],"algorithms":[112],"variety":[115],"problems":[117],"constant":[119],"graphs.":[123]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}