{"id":"https://openalex.org/W7156990437","doi":"https://doi.org/10.48550/arxiv.2604.23171","title":"Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs","display_name":"Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs","publication_year":2026,"publication_date":"2026-04-25","ids":{"openalex":"https://openalex.org/W7156990437","doi":"https://doi.org/10.48550/arxiv.2604.23171"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.23171","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23171","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.23171","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134788900","display_name":"Mark de Berg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Berg, Mark","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134764364","display_name":"Bart M. P. Jansen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jansen, Bart M. P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5119959247","display_name":"Jeroen S. K. Lamme","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lamme, Jeroen S. K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.6481999754905701,"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.6481999754905701,"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.2606000006198883,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.04989999905228615,"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/intersection","display_name":"Intersection (aeronautics)","score":0.7014999985694885},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5292999744415283},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49900001287460327},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4542999863624573},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4478999972343445},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.42750000953674316},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.39660000801086426},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38510000705718994}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7014999985694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6473000049591064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6467000246047974},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5292999744415283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5059000253677368},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49900001287460327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4542999863624573},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.39660000801086426},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38510000705718994},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.37040001153945923},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3172000050544739},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.30489999055862427},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2752000093460083},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.23171","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23171","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.23171","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23171","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"We":[0,24,170],"study":[1],"SINGLE-SOURCE":[2],"SHORTEST":[3],"PATH":[4],"(SSSP)":[5],"on":[6],"unweighted":[7],"intersection":[8,128,160,244],"graphs":[9,245],"whose":[10,40],"node":[11],"set":[12,16,177],"corresponds":[13],"to":[14,134,188,262],"a":[15,124,176,203,225,239],"of":[17,38,73,159,175,178,192,246],"$n$":[18],"constant-complexity":[19],"objects":[20,39,74],"in":[21,30,81,123,194,231,251],"the":[22,71,110,116,137,150,173],"plane.":[23],"prove":[25,171],"SSSP":[26,77,91,147],"can":[27,78,181,258],"be":[28,79,182,260],"solved":[29,80],"$O(U(n)\\":[31],"\\mathrm{polylog}\\,n)$":[32],"expected":[33,196],"time":[34,142,154,165],"for":[35,54,64,75,97,115,127,155,214,243,269],"any":[36,120],"class":[37,72],"union":[41],"complexity":[42],"is":[43,149,166,249],"$U(n)$.":[44],"In":[45],"particular,":[46],"we":[47,237],"obtain":[48,263],"an":[49,58,189,264],"$O(n":[50],"2^{\u03b1(n)}\\log^2":[51],"n)$":[52,62,84,90,140],"algorithm":[53,63,148,205],"arbitrary":[55,179],"pseudodisks,":[56,247],"and":[57,102,104,136,200,209,223,229,275],"$O(\u03bb_{s+2}(n)2^{O(\\log^*":[59],"n)}":[60],"\\log^2":[61],"locally":[65],"fat":[66,101,222],"objects.":[67],"This":[68,198],"significantly":[69],"extends":[70],"which":[76,113,248],"$O(n\\":[82,88],"\\mathrm{polylog}\\,":[83,89,139],"time:":[85],"so":[86],"far,":[87],"algorithms":[92,131],"were":[93],"not":[94],"even":[95,167],"known":[96],"pseudodisks":[98,180,219,270],"that":[99,143,172,212,220,271],"are":[100,132,221],"convex":[103],"similarly-sized.":[105],"Our":[106,255],"second":[107],"result":[108],"concerns":[109],"DIAMETER":[111],"problem,":[112],"asks":[114],"maximum":[117],"distance":[118,267],"between":[119],"two":[121],"nodes":[122],"graph.":[125],"Even":[126],"graphs,":[129],"near-quadratic":[130,152],"difficult":[133],"obtain,":[135],"$O(n^2\\":[138],"running":[141,153,164],"follows":[144],"from":[145],"our":[146],"first":[151],"such":[156],"general":[157],"classes":[158],"graphs.":[161],"Obtaining":[162],"subquadratic":[163],"more":[168],"challenging.":[169],"diameter":[174],"computed":[183],"almost":[184,265],"exactly,":[185],"namely":[186],"up":[187,202],"additive":[190],"error":[191],"2,":[193],"$\\tilde{O}(n^{2-1/14})$":[195],"time.":[197,233,279],"generalizes":[199],"speeds":[201],"recent":[204],"by":[206],"Chang,":[207],"Gao,":[208],"Le~(SoCG":[210],"2024)":[211],"works":[213],"similarly-sized":[215,218],"disks":[216],"(or":[217],"satisfy":[224],"strong":[226],"monotonicity":[227],"assumption)":[228],"runs":[230],"$\\tilde{O}(n^{2-1/18})$":[232],"To":[234],"this":[235],"end,":[236],"develop":[238],"so-called":[240],"star-based":[241,256],"$r$-clustering":[242,257],"interesting":[250],"its":[252],"own":[253],"right.":[254],"also":[259],"used":[261],"exact":[266],"oracle":[268],"uses":[272],"$O(n^{2-1/13})$":[273],"storage":[274],"has":[276],"$O(1)$":[277],"query":[278]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-29T00:00:00"}