{"id":"https://openalex.org/W7148761719","doi":"https://doi.org/10.48550/arxiv.2604.01829","title":"A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures","display_name":"A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures","publication_year":2026,"publication_date":"2026-04-02","ids":{"openalex":"https://openalex.org/W7148761719","doi":"https://doi.org/10.48550/arxiv.2604.01829"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01829","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01829","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.01829","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132836156","display_name":"Bernhard Haeupler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haeupler, Bernhard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048800352","display_name":"Yaowei Long","orcid":"https://orcid.org/0000-0002-1891-9897"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Long, Yaowei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068043839","display_name":"Antti Roeyskoe","orcid":"https://orcid.org/0009-0008-8405-823X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roeyskoe, Antti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132847795","display_name":"Thatchaphol Saranurak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saranurak, Thatchaphol","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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":null,"last_page":null},"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.8737000226974487,"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.8737000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.04390000179409981,"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/T10237","display_name":"Cryptography and Data Security","score":0.014100000262260437,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/scheme","display_name":"Scheme (mathematics)","score":0.583299994468689},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5716000199317932},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5527999997138977},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5034999847412109},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44679999351501465},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42100000381469727},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3630000054836273},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.33980000019073486}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7235000133514404},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.583299994468689},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5716000199317932},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5527999997138977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5507000088691711},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5034999847412109},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44679999351501465},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42100000381469727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4165000021457672},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33390000462532043},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.3172000050544739},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.27810001373291016},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.2583000063896179},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.25619998574256897},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C150433608","wikidata":"https://www.wikidata.org/wiki/Q5337633","display_name":"Edge-graceful labeling","level":5,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01829","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01829","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.01829","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01829","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"fault-tolerant":[1],"distance":[2,38,125],"labeling":[3,111],"scheme":[4,64,76,112],"assigns":[5],"a":[6,61,79,105],"label":[7,70],"to":[8,77],"each":[9],"vertex":[10],"and":[11,41,68,97],"edge":[12,26,87],"of":[13,29,52,86,117,124],"an":[14],"undirected":[15],"weighted":[16],"graph":[17],"$G$":[18],"with":[19,65],"$n$":[20],"vertices":[21],"so":[22],"that,":[23],"for":[24,129],"any":[25,57,84],"set":[27],"$F$":[28],"size":[30],"$|F|":[31],"\\leq":[32],"f$,":[33],"one":[34],"can":[35],"approximate":[36],"the":[37,50,74,91,115,118,121],"between":[39],"$p$":[40],"$q$":[42],"in":[43,120,154],"$G":[44],"\\setminus":[45],"F$":[46],"by":[47,95],"reading":[48],"only":[49,104],"labels":[51],"$F":[53],"\\cup":[54],"\\{p,q\\}$.":[55],"For":[56],"$k$,":[58],"we":[59],"present":[60],"deterministic":[62],"polynomial-time":[63],"$O(k^{4})$":[66],"approximation":[67,81,107,145,152],"$\\tilde{O}(f^{4}n^{1/k})$":[69],"size.":[71],"This":[72],"is":[73],"first":[75],"achieve":[78],"constant":[80],"while":[82],"handling":[83],"number":[85],"faults":[88],"$f$,":[89],"resolving":[90],"open":[92],"problem":[93],"posed":[94],"Dory":[96],"Parter":[98],"[DP21].":[99],"All":[100],"previous":[101,137],"schemes":[102],"provided":[103],"linear-in-$f$":[106,144],"[DP21,":[108],"LPS25].":[109],"Our":[110],"directly":[113],"improves":[114],"state":[116],"art":[119],"simpler":[122],"setting":[123],"sensitivity":[126],"oracles.":[127],"Even":[128],"just":[130],"$f":[131],"=":[132],"\u0398(\\log":[133],"n)$":[134],"faults,":[135],"all":[136],"oracles":[138],"either":[139],"have":[140],"super-linear":[141],"query":[142],"time,":[143],"[CLPR12],":[146],"or":[147],"exponentially":[148],"worse":[149],"$2^{{\\rm":[150],"poly}(k)}$":[151],"dependency":[153],"$k$":[155],"[HLS24].":[156]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-04T00:00:00"}